本文共 3108 字，大约阅读时间需要 10 分钟。
Zane the wizard had never loved anyone before, until he fell in love with a girl, whose name remains unknown to us.
The girl lives in house m of a village. There are n houses in that village, lining in a straight line from left to right: house 1, house 2, ..., house n. The village is also well-structured: house i and house i + 1 (1 ≤ i < n) are exactly 10 meters away. In this village, some houses are occupied, and some are not. Indeed, unoccupied houses can be purchased.
You will be given n integers a1, a2, ..., an that denote the availability and the prices of the houses. If house i is occupied, and therefore cannot be bought, then ai equals 0. Otherwise, house i can be bought, and ai represents the money required to buy it, in dollars.
As Zane has only k dollars to spare, it becomes a challenge for him to choose the house to purchase, so that he could live as near as possible to his crush. Help Zane determine the minimum distance from his crush's house to some house he can afford, to help him succeed in his love.
The first line contains three integers n, m, and k (2 ≤ n ≤ 100, 1 ≤ m ≤ n, 1 ≤ k ≤ 100) — the number of houses in the village, the house where the girl lives, and the amount of money Zane has (in dollars), respectively.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 100) — denoting the availability and the prices of the houses.
It is guaranteed that am = 0 and that it is possible to purchase some house with no more than k dollars.
Print one integer — the minimum distance, in meters, from the house where the girl Zane likes lives to the house Zane can buy.
5 1 200 27 32 21 19
40
7 3 5062 0 0 0 99 33 22
30
10 5 1001 0 1 0 0 0 0 0 1 1
20
In the first sample, with k = 20 dollars, Zane can buy only house 5. The distance from house m = 1 to house 5 is10 + 10 + 10 + 10 = 40 meters.
In the second sample, Zane can buy houses 6 and 7. It is better to buy house 6 than house 7, since house m = 3 and house 6 are only 30 meters away, while house m = 3 and house 7 are 40 meters away.
题意：很明显就是给你一列数，然后给你一个下标，给出你某某现在有多少钱，然后求最短距离，注意如果某个数的值为0的话这点是不能进行买卖的。
代码：
#includeusing namespace std;const int INF=0x1f1f1f;const int maxn=105;int a[maxn];int main(){ int n,m,k; while(~scanf("%d%d%d",&n,&m,&k)) { memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } int num=a[m]; int sum1=INF; int sum=0; int sum2=INF; for(int i=m+1;i<=n;i++) { if(k>=a[i]&&a[i]!=0) { sum1=i; break; } } for(int i=m-1;i>=1;i--) { if(k>=a[i]&&a[i]!=0) { sum2=i; break; } } sum1=abs(sum1-m); sum2=abs(sum2-m); sum=min(sum1,sum2); printf("%d\n",sum*10); } return 0;}
转载地址：https://dh-butterfly.blog.csdn.net/article/details/70159450 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！
发表评论
最新留言
关于作者
