CodeForces - 796A Buying A House

思路：从m直接向两边枚举，如果当前点需要的费用小于等于k，说明一定是最近距离。

AC代码

#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int>
typedef long long LL;
const int maxn = 100 + 5;
int a[maxn];
int main() {
	int n, m, k;
	while(scanf("%d%d%d", &n, &m, &k) == 3) {
		for(int i = 1; i <= n; ++i) {
			scanf("%d", &a[i]);
		}
		int ans;
		for(int i = 1; i < n; ++i) {
			if(m-i > 0 && a[m-i] <= k && a[m-i]) {
				ans = i;
				break;
			}
			if(m+i <= n && a[m+i] <= k && a[m+i]) {
				ans = i;
				break;
			}
		}
		printf("%d\n", ans*10);
	}

	return 0;
}

如有不当之处欢迎指出！