PAT (Advanced Level) Practice 题目集合（1051 ~ 1100）（正在更新）

1051 Pop Sequence (25 分)

#include
using namespace std;
const int N = 1e5+10;
int n, m, k;
int a[N], b[N];

int main()
{
	cin >> m >> n >> k;
	for (int i = 1;i  b[i];
		
		for (int i = 1, j = 1;i  m) break;
			while (stk.size() && j > n >> head;
	
	for (int i = 0;i > add >> key >> nxt;
		node[i] = {key, add};
		a[add] = nxt;
	}	
	
	int p = head;
	while (p != -1) {
		st[p] = 1;
		p = a[p];
	}
	
	sort (node, node+n);
	
	for (int i = 0;i  amin >> amax;
		cout