Competitive-Programming/topic/segment-tree/day3a.cpp at master · HanaYukii/Competitive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include<iostream>
using namespace std;

const int MAXN = 300005;
long long add[MAXN<<2];
long long mi[MAXN<<2];
long long mx[MAXN<<2];
long long amx,ami;
void pushdown(int x){
	if(add[x]){
		add[x<<1] += add[x];
		add[x<<1|1] += add[x];
		mi[x<<1] += add[x];
		mi[x<<1|1] += add[x];
		mx[x<<1] += add[x];
		mx[x<<1|1] += add[x];
		add[x] = 0;
	}
	mi[x<<1] = max(mi[x<<1],mi[x]);
	mi[x<<1] = min(mi[x<<1],mx[x]);
	mx[x<<1] = max(mx[x<<1],mi[x]);
	mx[x<<1] = min(mx[x<<1],mx[x]);
	mi[x<<1|1] = max(mi[x<<1|1],mi[x]);
	mi[x<<1|1] = min(mi[x<<1|1],mx[x]);
	mx[x<<1|1] = max(mx[x<<1|1],mi[x]);
	mx[x<<1|1] = min(mx[x<<1|1],mx[x]);
}
void pushup(int x){
    mx[x] = max(mx[x<<1],mx[x<<1|1]);
    mi[x] = min(mi[x<<1],mi[x<<1|1]);
}
void build(int x,int l,int r){
    if(l==r){
        cin >> mi[x];
        mx[x] = mi[x];
        return;
    }
    int mid = (l+r) >> 1;
    build(x<<1,l,mid);
    build(x<<1|1,mid+1,r);
    pushup(x);
}
void update(int x,int l,int r,int ql,int qr,long long v,int op){
    if(l==ql&&r==qr){
        if(op==1){
        	add[x] += v;
        	mi[x] += v;
        	mx[x] += v;
        }
        else if(op==2){
        	mx[x] = min(mx[x],v);
        	mi[x] = min(mi[x],v);
        }
        else{
        	mx[x] = max(mx[x],v);
        	mi[x] = max(mi[x],v);
        }
        return;
    }
    pushdown(x);
    int mid = (l+r) >> 1;
    if(qr<=mid){
        update(x<<1,l,mid,ql,qr,v,op);
    }
    else if(ql>mid){
        update(x<<1|1,mid+1,r,ql,qr,v,op);
    }
    else{
        update(x<<1,l,mid,ql,mid,v,op);
        update(x<<1|1,mid+1,r,mid+1,qr,v,op);
    }
    pushup(x);
}
void query(int x,int l,int r,int ql,int qr){
    if(l==ql&&r==qr){
    	amx = max(amx,mx[x]);
    	ami = min(ami,mi[x]);
    	return ;
    }
    pushdown(x);
    int mid = (l+r) >> 1;
    if(qr<=mid){
        query(x<<1,l,mid,ql,qr);
    }
    else if(ql>mid){
        query(x<<1|1,mid+1,r,ql,qr);
    }
    else{
        query(x<<1,l,mid,ql,mid);
        query(x<<1|1,mid+1,r,mid+1,qr);
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin >> n >> k;
    build(1,1,n);
    while(k--){
        int op,l,r;
        cin >> op >> l >> r;
        if(op==4){
        	ami = 2e9;
        	amx = -2e9;
        	query(1,1,n,l,r);
        	cout << ami << ' ' << amx << '\n';
        }
        else{
        	int v;
        	cin >> v;
        	update(1,1,n,l,r,v,op);
        }
    }
}