107序列操作(后缀最大值)

 

 

/**\
记录操作1的最后一次出现的地方,(前面操作都没有用),
然后对比他的下一次操作二的最大值(这里处理一个后缀最大值即可)
\**/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define go continue
#define int long long
#define PII pair<int, int>
#define sf(x) scanf("%lld",&x)
#define ytz int _; sf(_); while(_--)
#define fory(i,a,b) for(int i = a; i <= b; ++i)
#define forl(i,a,b) for(int i = a; i >= b; --i)
#define debug(a) cout << #a << " = " << a <<endl;
const int N = 1e6 + 9;
int n, q;
int last[N], val[N], s[N], a[N];
signed main()
{
    int cmp = -1e18;
    sf(n), sf(q);
    fory(i, 1, n) sf(a[i]), val[i] = a[i];
    fory(i, 1, q)
    {
        int op;
        sf(op);
        if(op == 1)
        {
            int x, y;
            sf(x), sf(y);
            last[x] = i;
            val[x] = y;
        }
        else
        {
            sf(s[i]);
            cmp = max(cmp,s[i]);
        }
    }
    for(int i = q; i >= 1; --i) s[i] = max(s[i], s[i + 1]);

    fory(i, 1, n)
    {
        if(last[i] == 0)
        {
            a[i] = max(a[i], cmp);
        }
        else
        {
            a[i] = max(val[i], s[last[i] + 1]);
        }
    }
    fory(i, 1, n) printf("%lld ", a[i]);
    return 0;
}