1051. Pop Sequence (25)
2017-04-09 18:13
405 查看
#include <iostream> #include <stdio.h> #include <string.h> #include <vector> #include <map> #include <stack> #include <queue> #include <algorithm> #include <set> using namespace std; int main(){ int m,n,k; //freopen("E://PAT/input.txt", "r", stdin); scanf("%d %d %d",&m,&n,&k); while(k--){ stack<int> s; bool flag=true; int cur=1; for(int j=0;j<n;j++){ int num; scanf("%d",&num); if(flag){ while(s.empty()||s.top()!=num){ s.push(cur); if(s.size()>m){ flag=false; break; } cur++; } if(flag&&s.size()>=1&&s.top()==num) s.pop(); } } if(flag) printf("YES\n"); else 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)
- 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)
- PAT (Advanced Level) Practise 1051 Pop Sequence (25)
- 1051. Pop Sequence (25)解题报告
- 1051.Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)