1051. Pop Sequence (25)
2016-11-05 14:32
435 查看
1051. Pop Sequence (25)
#include <stdio.h> int main() { int stack[1000],top; int m,n,k; scanf("%d %d %d",&m,&n,&k); while(k--) { int v=1,i,e; top=0; for(i=0;i<n;i++) { scanf("%d",&e); while(v<=e) { stack[top++]=v++; if(top>=m)break; } if(stack[top-1]==e) top--; else break; } if(i==n) printf("YES\n"); else { char str[100]; gets(str); printf("NO\n"); } } return 0; }
相关文章推荐
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- PAT甲级真题及训练集(6)--1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- PAT - 甲级 - 1051. Pop Sequence (25)(模拟)
- 1051. Pop Sequence (25)
- PAT (Advanced Level) Practise 1051 Pop Sequence (25)
- 1051.Pop Sequence (25) PAT甲级刷题
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051.Pop Sequence (25)
- PAT (Advanced Level) Practise 1051 Pop Sequence (25)
- 1051. Pop Sequence (25)解题报告