UVA 11093(p246)----Just Finish it up

来源：互联网发布：stc单片机引脚定义编辑：程序博客网时间：2024/06/11 20:05

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#define debuusing namespace std;const int maxn=1e5+50;int cas=0,n;int v[maxn];int gt[maxn];int cost[maxn];void solve(){    memset(v,0,sizeof(v));    int i=0,ans=-1,pos,flag;    int num=0,nw;    while(i<n)    {        nw=0;        flag=1;        v[i]=1;        for(int j=0; j<n; j++)        {            int nt=(i+j)%n;            nw-=cost[nt];            nw+=gt[nt];            if(nw<0)            {                flag=0;                pos=nt;                break;            }        }        if(flag)        {            ans=i;            break;        }        i=pos+1;        if(v[i]) break;    }    if(ans!=-1)        printf("Case %d: Possible from station %d\n",++cas,ans+1);    else printf("Case %d: Not possible\n",++cas);}int main(){#ifdef debug    freopen("in.in","r",stdin);#endif // debug    int t;    scanf("%d",&t);    while(t--)    {        scanf("%d",&n);        for(int i=0; i<n; i++)            scanf("%d",>[i]);        for(int i=0; i<n; i++)            scanf("%d",&cost[i]);        solve();    }    return 0;}

0 0