uva 11093 Just Finish it up (环形跑道水题_模拟)

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=101001;
int a[maxn],b[maxn];
int main()
{
int t,n,i,j,sum,num,ans;
cin>>t;
for(int z=1;z<=t;z++) {
cin>>n;
for(i=1;i<=n;i++) cin>>b[i];
sum=0;
for(i=1;i<=n;i++) {
cin>>num;
a[i]=b[i]-num;
sum+=a[i];
}
if(sum<0) {
printf("Case %d: Not possible\n",z);
continue;
}
sum=0;
for(i=1;i<=n;i++) {
sum+=a[i];
if(sum<0) {
sum=0;
ans=i+1;
}
}
printf("Case %d: Possible from station %d\n",z,ans);
}
return 0;
}