Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.
Input Specification:
Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): M (the maximum capacity of the stack), N (the length of push sequence), and K (the number of pop sequences to be checked). Then K lines follow, each contains a pop sequence of N numbers. All the numbers in a line are separated by a space.
Output Specification:
For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.
Sample Input:
5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2
Sample Output:
YES
NO
NO
YES
NO
思路很简单,输出一遍即可。
#include <iostream>
#include <stack>
#include <vector>
#include <string>
using namespace std;
bool check(int M,int N,int *a);
int main()
{
int M,N,K;
vector<string> result;
cin>>M>>N>>K;
int *a=new int[N];
for(int i=0;i<K;i++)
{
for(int j=0;j<N;j++)
{
cin>>a[j];
}
if( check(M,N,a))
result.push_back("YES");
else result.push_back("NO");
}
for(int i=0;i<K;i++)
{
cout<<result[i]<<endl;
}
return 0;
}
bool check(int M,int N,int *a)//进行判断
{
stack <int> l;
int k=1;
int j=0;
int num=0;
for(k=1;k<=N;k++)
{
l.push(k);
num++;
if(num>M) return false;
while(!l.empty()&&l.top()==a[j])
{
l.pop();
num--;
j++;
}
}
if(j!=N)
return false;
return true;
}