Vasya And Array CodeForces

Vasya And Array

题意：

给你一个序列，再给你一些区间

t = 1时说明这些区间时非递减的

t = 0 时说明这些区间至少有一对数字 arr[i] > arr[i - 1]

思路：

只要左边的区间必然右边的区间大就好了 ， 非递减区间中的数字都赋值为一样的数字

因为n只有1000 ， 把初值cnt赋值为1e6 , 每次给区间赋值的时候 -1000

把第一种情况的区间赋值完成之后，剩下的还没有赋值的部分，都赋值为单调递减序列就可以了

#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<cctype>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define mem(a,x) memset(a,x,sizeof(a))
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid + 1,r
#define P pair<int,int>
#define ull unsigned long long
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const ll mod = 998244353;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-7;
inline ll read()
{
    ll X = 0, w = 0; char ch = 0;
    while (!isdigit(ch)) { w |= ch == '-'; ch = getchar(); }
    while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
    return w ? -X : X;
}
int arr[maxn] , brr[maxn];
int n, m;
struct node
{
    int l, r, judge;
}q[maxn];

int cmp(struct node& a, struct node& b)
{
    if (a.judge == b.judge) return a.l < b.l;
    return a.judge > b.judge;
}
int main()
{
    while (~scanf("%d %d", &n, &m))
    {
        int cnt = 0;
        int flag = 1;
        for (int i = 1; i <= m; ++i)
        {
            q[i].judge = read(), q[i].l = read(), q[i].r = read();
        }
        sort(q + 1, q + 1 + m, cmp);
        for (int i = 1; i <= m; ++i)
        {
            if (q[i].judge == 1)
            {
                if(arr[q[i].l] == 0) cnt -= 1000;
                for (int j = q[i].l; j <= q[i].r; ++j) arr[j] = cnt;
            }
        }
        for (int i = 1; i <= n; ++i)
        {
            if (arr[i] == 0) arr[i] = arr[i - 1] - 1;
        }
        for (int i = 1; i <= m; ++i)
        {
            
            if (q[i].judge == 0)
            {
                int tmp = 0;
                for (int j = q[i].l; j < q[i].r; ++j)
                {
                    if (arr[j] > arr[j + 1])
                    {
                        tmp = 1;
                        break;
                    }
                }
                if (tmp == 0)
                {
                    flag = 0;
                    break;
                }
            }
        }
        if (flag == 0)
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
            for (int i = 1; i <= n; ++i)
            {
                cout << arr[i] + 1000000 << " ";
                if (i == n) cout << endl;
            }
        }
        
    }
    return 0;
}