POJ 1363 Rails(模拟栈)

原地址http://blog.csdn.net/kk303/article/details/7203339

#include<iostream>
#include<stdio.h>
using namespace std;
int n,a[1005],i;
bool ok()
{
      int mystack[1005],num=0,i,k=1;
      for (i=1;i<=n;i++)
      {
            mystack[++num]=i;
            while (num && a[k]==mystack[num])
            {
                   num--;
                   k++;
            }
      }
      if (num) return false;
         else  return true;
}
int main()
{
      int p=0;
      scanf("%d",&n);
      while (n)
      {
            if (p) printf("\n");
            p++;
            scanf("%d",&a[1]);
            while (a[1])
            {
                  for (i=2;i<=n;i++) scanf("%d",&a[i]);
                  if (ok()) printf("Yes\n"); else printf("No\n");
                  scanf("%d",&a[1]);
            }
            scanf("%d",&n);
      }
      return 0;
}