UVa11093 Just Finish it up (模拟)

 1 #include <cstdio>
 2 
 3 const int maxn = 100005;
 4 
 5 int n, p[maxn], q[maxn];
 6 
 7 int go(int n) {
 8     for (int st = 0; st < n; st++) {
 9         int fuel = 0, i;
10         for (i = 0; i < n; i++) {
11             fuel += p[(st+i)%n] - q[(st+i)%n];
12             if (fuel < 0) { st += i; break; }
13         }
14         if (i == n) return st;
15     }
16     return -1;
17 }
18 
19 int main() {
20     int T;
21     scanf("%d", &T);
22     for (int kase = 1; kase <= T; kase++) {
23         scanf("%d", &n);
24         for (int i = 0; i < n; i++) scanf("%d", &p[i]);
25         for (int i = 0; i < n; i++) scanf("%d", &q[i]);
26         int ans = go(n);
27         printf("Case %d: ", kase);
28         if (ans < 0) printf("Not possible\n");
29         else printf("Possible from station %d\n", ans + 1);
30     }
31     return 0;
32 }