pat 1051

最新推荐文章于 2019-02-21 09:59:18 发布

walter1990

最新推荐文章于 2019-02-21 09:59:18 发布

阅读量621

点赞数

本文链接：https://blog.csdn.net/suichen1/article/details/21239507

版权

1051. Pop Sequence (25)

时间限制

10 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

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 <stdio.h>

int sak[1010], cap, top;
int m, n, k;

int main()
{
	int i, j, tmp, t, max;
	bool flag;

	while(scanf("%d%d%d", &m, &n, &k) != EOF)
	{
		for(i = 1; i <= k; i++)
		{
			top = cap = max = 0;
			flag = true;

			for(j = 1; j <= n; j++)
			{
				scanf("%d", &tmp);

				if(top == 0)
				{
					for(t = max+1; t <= tmp; t++)
					{
						sak[top++] = t;
						cap++;

						if(t > max) max = t;
					}

					if(cap > m) 
					{
						flag = false;
					}
					else 
					{
						cap--;
						top--;
					}
				}
				else 
				{
					if(sak[top-1] == tmp)
					{
						top--;
						cap--;
					}
					else 
					{
						for(t = 0; t < top; t++)
						{
							if(sak[t] == tmp)
							{
								flag = false;
								break;
							}
						}

						if(flag)
						{
							for(t = max + 1; t <= tmp; t++)
							{
								sak[top++] = t;
								cap++;
								if(t>max)
									max = t;
							}

							if(cap>m)
							{
								flag = false;
							}
							else
							{
								top--;
								cap--;
							}
						}
					}
				}
			}
			
			if(flag) printf("YES\n");

			else printf("NO\n");
		}
	}
	return 0;
}