http://codeforces.com/problemset/problem/739/B dfs,记录距离前缀和,每次找到离最近的不符合的点. #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<vector> using namespace std; ,a[],b[],sta[],ans[] = {}; ]; vector<…