线段树
GSS3 - Can you answer these queries III

Luogu
Vjudge

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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#pragma GCC optimize ("-fdelete-null-pointer-checks,inline-functions-called-once,-funsafe-loop-optimizations,-fexpensive-optimizations,-foptimize-sibling-calls,-ftree-switch-conversion,-finline-small-functions,inline-small-functions,-frerun-cse-after-loop,-fhoist-adjacent-loads,-findirect-inlining,-freorder-functions,no-stack-protector,-fpartial-inlining,-fsched-interblock,-fcse-follow-jumps,-fcse-skip-blocks,-falign-functions,-fstrict-overflow,-fstrict-aliasing,-fschedule-insns2,-ftree-tail-merge,inline-functions,-fschedule-insns,-freorder-blocks,-fwhole-program,-funroll-loops,-fthread-jumps,-fcrossjumping,-fcaller-saves,-fdevirtualize,-falign-labels,-falign-loops,-falign-jumps,unroll-loops,-fsched-spec,-ffast-math,Ofast,inline,-fgcse,-fgcse-lm,-fipa-sra,-ftree-pre,-ftree-vrp,-fpeephole2", 3)
#pragma G++ optimize ("Ofast", 3)
#pragma GCC optimize ("Ofast", 3)
#pragma GCC target ("sse3","sse2","sse")
#pragma GCC target ("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target ("f16c")
#pragma G++ target ("sse3","sse2","sse")
#pragma G++ target ("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma G++ target ("f16c")

#include <stdio.h>
#include <ctype.h>

#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define rint register int

int n, m, x, y, in, opt;
struct node {
int sum, lmax, rmax, dat, l, r;
} tr[200001];

namespace FastIO {
const int str=1<<20;
const char* endl="\n";
struct Reader {
char buf[str],*s,*t;
bool EOF_FLG;
Reader():s(buf),t(buf),EOF_FLG(false) {};
inline char gt() {
return s==t&&((t=(s=buf)+fread(buf,1,str,stdin))==s)?EOF:(*s++);
}
template<typename T>Reader&operator>>(T&x) {
if(EOF_FLG)return *this;
register char c=0,d;
while(c!=EOF&&(c<'0'||c>'9'))d=c,c=gt();
if(c==EOF) {
EOF_FLG=true;
return *this;
} else x=0;
while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+c-'0',c=gt();
if(d=='-')x=-x;
return *this;
}
} cin;
struct Writer {
char buf[str],*s,*t;
Writer():s(buf),t(buf+str) {}
~Writer() {
fwrite(buf,1,s-buf,stdout);
}
inline void pt(char c) {
(s==t)?(fwrite(s=buf,1,str,stdout),*s++=c):(*s++=c);
}
template<typename T>Writer&operator<<(T x) {
if(!x)return pt('0'),*this;
if(x<0)pt('-'),x=-x;
register char a[30],t=0;
while(x)a[t++]=x%10,x/=10;
while(t--)pt(a[t]+'0');
return *this;
}
Writer&operator<<(const char*s) {
while(*s)pt(*s++);
return *this;
}
} cout;
}
inline const int& max(const int& x,const int& y) {
return x>y?x:y;
}
inline void update (int rt) {
tr[rt].sum =tr[rt<<1].sum + tr[rt<<1|1].sum;
tr[rt].lmax= max (tr[rt<<1].lmax, tr[rt<<1].sum + tr[rt<<1|1].lmax);
tr[rt].rmax= max (tr[rt<<1|1].rmax, tr[rt<<1|1].sum + tr[rt<<1].rmax);
tr[rt].dat = max (max(tr[rt<<1].dat, tr[rt<<1|1].dat), tr[rt<<1].rmax + tr[rt<<1|1].lmax);
}
inline void build (int rt,int l,int r) {
tr[rt].l = l, tr[rt].r = r;
if(l==r) {
FastIO::cin>>in;
tr[rt].dat = tr[rt].sum = tr[rt].lmax = tr[rt].rmax = in;
return;
}
int mid = (l+r)>>1;
build (lson);
build (rson);
update (rt);
}
inline node query (int rt, int l, int r, int ql, int qr) {
if (ql <= l && qr >= r) return tr[rt];
int mid = (l+r)>>1;
if (ql > mid) return query (rson, ql, qr);
if (qr <= mid) return query (lson, ql, qr);
else {
node ans,a,b;
a = query (lson,ql,qr);
b = query (rson,ql,qr);
ans.sum = a.sum + b.sum;
ans.dat = max (a.dat, a.rmax + b.lmax), ans.dat = max (ans.dat, b.dat);
ans.lmax= max (a.lmax, a.sum + b.lmax);
ans.rmax= max (b.rmax, b.sum + a.rmax);
return ans;
}
}

inline void work (int rt, int to, int val)
{
if (tr[rt].l == tr[rt].r) {
tr[rt].sum = tr[rt].lmax = tr[rt].rmax = tr[rt].dat = val; return;
}
register int mid = (tr[rt].l + tr[rt].r) >> 1;
if (to <= mid) work (rt<<1, to, val);
else work (rt<<1|1, to, val);
update(rt);
}

using namespace FastIO;

int main ()
{
//freopen ("nico.in","r",stdin);
cin >> n;
build (1, 1, n);
cin >> m;
while (m --) {
cin >> opt >> x >> y;
if (opt) cout << query (1, 1, n, x, y).dat << endl;
else work (1,x,y);
}
return 0;
}

Comments

Please contact the Administrator directly for emergency.





GitHub release (latest by date including pre-releases) GitHub release (latest by date including pre-releases) GitHub repo size GitHub repo size PictureBed PictureBed

Blog content follows the Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) License

Copyright 2017-2020 ELLIAS views, viewersLoading... Loading...
MOE ICP 辽ICP备20009666号-1 | MOE ICP MOEICP备20201096号