problem:street parade:   http://www.spoj.pl/problems/STPAR/
my code give correct answer for all test case that i run but still it give
WA. plz provide me more test cases .
my code is


#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
        int n,a[1010],b[1010],s[1010],t=0,q=1;
        scanf("%d",&n);//2 1 4 3

        while(n)
        {       int i=0,f=0,j=0;
                q=1;t=0;s[0]=100001;
                for(i=0;i<n;i++)
                {
                              scanf("%d",&a[i]);
                              b[i]=a[i];
                              }
                         sort(a,a+n);
                        for(i=0;i<n;i++)
                        {
                              if(i<(n-1)&&a[i]==a[i+1])
                              {
                                f=1;break;}
                                if(s[t]==a[j])
                                {
                                        j++;
                                        t--;
                                }

                      else  if(b[i]==a[j])
                        {
                        j++;
                        }
                        else
                        {
                                if(s[t]==a[j])
                                {
                                        j++;
                                        t--;
                                        if(t==0)

                                        s[0]=100001;
                                }
                                else if(s[t]<b[i])
                                {
                                        f=1;
                                        break;
                                }
                                        else
                                        {
                                                if(t==0&&s[0]==100001)
                                               {
                                                s[t]=b[i];
                                                }else
                                                {
                                                t=t+1;
                                                s[t]=b[i];
                                                }
                                        }
                        }

                }
               while(t>=0&&s[0]!=100001)
               {
                        if(s[t]==a[j])
                        {
                                t--;
                                 if(t==0)

                                        s[0]=100001;
                                j++;
                        }
                        else
                        {
                        f=1;
                        break;
                        }
               }

                if(f==1)
                printf("no\n");
                else
                {


                printf("yes\n");
              }
                        scanf("%d",&n);
        }
}

Thanx in advance
*
Anshul Agarwal
Nit Allahabad
Computer Science**
*

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to