题目描述
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.
输入描述:
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.
输出描述:
For each pop sequence, print in one line "YES" if it is indeed a possible pop sequence of the stack, or "NO" if not.
输入例子:
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
输出例子:
YES NO NO YES NO
代码:
思路,运用栈进行模拟,对测试用例的的栈顶进行判断,例如,测试样例5 6 4 3 7 2 1,首先输入5,想要出栈的元素为5,则必须将1,2,3,4,5都压入栈中,则栈顶是5。
则有如下判断,如果栈顶元素和样例中需要的出栈的元素进行比较,若相等,则出栈,若不相等,则说明不存在这个出栈顺序。
#include<iostream>
#include<stack>
#include<cstdio>
#include<cstdlib>
using namespace std;
stack<int>s;
int main()
{
int m,n,k;
cin>>m>>n>>k;
for(int i=0;i<k;i++)//输入k组测试样例,对k组测试样例进行测试
{
int num=1,x=-1;//num来保存有多少个元素已经进入过栈中,x用来保存输入的每组测试用例中的每个元素
bool flag=true;
for(int j=0;j<n;j++)//依次输入每组测试用例中的每个元素
{
cin>>x;
while(num<=x)//若测试样例5 6 4 3 7 2 1,首先输入5到x,说明想要出栈的元素为5,则必须将1,2,3,4,5都压入栈中,则栈顶是5。
{
s.push(num++);
}
int y=s.top();
if(y!=x||s.size()>m)//这里进行判断要求出栈的元素是不是和栈顶相等,不相等说明错误,判断栈中元素是否多于栈的容量,若多于,说明错误。
flag=false;
s.pop();
}
if(flag==false)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}