Uva 11093 Just Finish it up——思路题

Uva 11093 Just Finish it up——思路题

#include #include using namespace std;const int maxn = 100000 + 10;int n, a[maxn], b[maxn];int main(){ int T, flag = 0, i, j, sum; scanf("%d", &T); while (T--) { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &a[i]); for (int i = 0; i < n; i++) scanf("%d", &b[i]); printf("Case %d: ", ++flag); bool ok = false; for (i = 0; i < n; i++) { j = i, sum = 0; while (true) { sum += a[j] - b[j]; if (sum < 0) { j = (j + 1) % n; break; } else j = (j + 1) % n; if (j == i) { ok = true; break; } } if (ok) break; else { if (j > i) i = j - 1;//-1是为了抵消i++ else break; } } if (ok) printf("Possible from station %d\n", i + 1); else printf("Not possible\n"); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。