D - Welfare State

在赛场上用set和vetor< pair>来维护的，发现有点做麻烦了，我们只需要记录时间轴即可。
然后从后往前更新时间轴。因为越往后的影响是最大的。

    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<cmath>
    #include<cstdlib>
    #include<climits>
    #include<stack>
    #include<vector>
    #include<queue>
    #include<set>
    #include<map>
    //#include<regex>
    #include<cstdio>
    #define up(i,a,b)  for(int i=a;i<b;i++)
    #define dw(i,a,b)  for(int i=a;i>b;i--)
    #define upd(i,a,b) for(int i=a;i<=b;i++)
    #define dwd(i,a,b) for(int i=a;i>=b;i--)
    //#define local
    typedef long long ll;
    const double esp = 1e-6;
    const double pi = acos(-1.0);
    const int INF = 0x3f3f3f3f;
    const int inf = 1e9;
    using namespace std;
    int read()
    {
    	char ch = getchar(); int x = 0, f = 1;
    	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
    	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
    	return x * f;
    }
    typedef pair<int, int> pir;
    const int N = 2e5 + 10;
    int n;
    int a[N];
    int q;
    int x[N], y[N];
    int main()
    {
    	n = read();
    	upd(i, 1, n)a[i] = read();
    	q = read();
    	int cnt = 0;
    	while (q--)
    	{
    		int temp;
    		temp = read();
    		if (temp == 1)
    		{
    			int p, xx; p = read(), xx = read();
    			a[p] = xx;
    			x[p] = cnt;
    		}
    		else
    		{
    			int p; p = read();
    			y[cnt] = p;
    		}
    		cnt++;
    	}
    	dwd(i, cnt - 1, 0)
    		y[i] = max(y[i + 1], y[i]);
    	upd(i, 1, n)
    	{
    		cout << max(a[i], y[x[i]])<<" ";
    	}
    	return 0;
    }