铁轨（ Rails, ACM/ICPC CERC 1997, UVa 514）

照抄不知道对不对

#include<iostream>
#include<stack>
#include<cstdio>
using namespace std;

const int MAXN = 1000 + 10;
int n, target[MAXN];


int main() {
	while (scanf("%d", &n) == 1) {
		stack<int> s;
		int A = 1, B = 1;
		for (int i = 1; i <= n; i++) {
			scanf("%d", &target[i]);
		}
		int ok = 1;
		while (B <= n) {
			if (A == target[B]) {
				A++;
				B++;
			}
			else if (!s.empty() && s.top() == target[B]) {
				s.pop();
				B++;
			}
			else if (A <= n)
				s.push(A++);
			else {
				ok = 0; break;
			}
		}
		printf("%s\n", ok ? "yes" : "No");
	}
	return 0;
}