SPOJ Street Parade solution

Revision en1, by vee_sharp, 2015-12-15 16:35:38

I am trying to solve SPOJ street parade. But i dont know what is wrong in the following code: ~~~~~

include

include

include

include

using namespace std; int main(){ int n,ne,last; cin>>n; while(n!=0){ int ar[n]; last=0; stack s; for(int i=0;i<n;i++) cin>>ar[i]; for(int i=0;i<n;i++){ if(s.top()==(last+1)){ s.pop(); last++; } else if(ar[i]==(last+1)) last++; else if(!s.empty() && s.top()<ar[i]){ cout<<"no"<<endl; continue; } else s.push(ar[i]); } cout<<"yes"<<endl; cin>>n; } return 0; }

~~~~~

Tags stack, spoj, c++

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English vee_sharp 2015-12-15 16:36:09 5 Tiny change: 'ng code:\n[cut]\n~~~~~\n#' -
en1 English vee_sharp 2015-12-15 16:35:38 706 Initial revision (published)