调度员的烦恼

tintin130

于 2024-05-27 19:29:18 发布

阅读量357

点赞数 4

文章标签：算法 c++ 数据结构

本文链接：https://blog.youkuaiyun.com/tintin130/article/details/139245961

版权

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 1010;
int stack[N], a[N];
int top, n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    top = 0;
    for (int i = 1, cur = 1; i <= n; ++i){
        while (cur <= a[i])
            stack[++top] = cur++;
        if (stack[top] == a[i])
            --top;
        else{
            cout << "NO" << endl;
            return 0;
        }
    }
    cout << "YES" << endl;
    return 0;
}