Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
晕。。。同样的代码 同样的题 在zju上就AC了 在这就WA了 莫非是ZJU太弱了????#include<iostream> using namespace std; int answer[500000]={0}; bool b[3100000]={0}; void slove(int k) { if(answer[k]) return; else { if(answer[k-1]-k<=0||(answer[k-1]-k>=0&&b[answer[k-1]-k])) {answer[k]=answer[k-1]+k;} else answer[k]=answer[k-1]-k; } b[answer[k]]=1; } int main() { int s[1000],count=0; answer[0]=0;b[0]=1; while(1) { int k,start=0; cin>>k; if(k==-1) break; for(int i=k;i>=0;i--) if(answer[i]) start=i; for(int j=start;j<=k;j++) slove(j); s[count++]=answer[k]; } for(int h=0;h<count;h++) cout<<s[h]<<endl; return 0; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator