GSS4 - Can you answer these queries V
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 (2)
#pragma G++ optimize (2)
#pragma GCC optimize (3)
#pragma G++ optimize (3)
#pragma GCC optimize ("Ofast")
#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 <cstdio>

const int ELAS = 1<<14;
static char buf[ELAS], *p1 = buf, *p2 = buf;
inline char gc()
{
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,ELAS,stdin),p1==p2)?EOF:*p1++;
}
inline long long read ()
{
register long long x = 0; register char c = gc(); register bool m = 0;
while (c < '0' || c > '9') {if (c == '-') m = true; c = gc();}
while (c>='0'&&c<='9') x = (x << 3) + (x << 1) + (c ^ '0'), c = gc();
return m? -x:x;
}
static void write (long long x)
{
if (x > 9) write (x / 10);
putchar (x % 10 + 48);
}
static void writelen (long long x)
{
if (x < 0ll) putchar('-'), x = -x;
write (x), putchar ('\n');
}

#define Re register
#define maxn 10001
#define dmax 40001
#define swap(x,y) ((y)^=(x)^=(y)^=(x))

struct node {
int l, r;
long long sum, lmax, rmax, dat;
} tr[dmax], null;

inline const long long& max (const long long& x,const long long& y) {return x>y? x:y;}

inline void update (int rt)
{
register int lson = rt<<1, rson = rt<<1|1;
tr[rt].sum = tr[lson].sum + tr[rson].sum;
tr[rt].lmax= max (tr[lson].lmax, tr[lson].sum + tr[rson].lmax);
tr[rt].rmax= max (tr[rson].rmax, tr[rson].sum + tr[lson].rmax);
tr[rt].dat = max (max(tr[lson].dat, tr[rson].dat), tr[lson].rmax + tr[rson].lmax);
}

static void build (int rt, int l, int r) {
tr[rt].l = l, tr[rt].r = r;
if (l == r) {tr[rt].dat = tr[rt].sum = tr[rt].lmax = tr[rt].rmax = read (); return;}
register int mid = (l + r) >> 1;
build (rt<<1, l, mid), build (rt<<1|1, mid + 1, r);
update (rt);
}

static node query (int rt, int ql, int qr) {
register int l = tr[rt].l, r = tr[rt].r;
if (ql > qr) return null;
if (ql <= l && qr >= r) return tr[rt];
register int mid = (l + r) >> 1;
if (ql > mid) return query (rt<<1|1,ql,qr);
if (qr <= mid) return query (rt<<1, ql, qr);
else
{
register node ret, a, b;
a = query (rt<<1, ql, qr), b = query (rt<<1|1, ql, qr);
ret.sum = a.sum + b.sum;
ret.dat = max (a.dat, a.rmax + b.lmax), ret.dat = max (ret.dat, b.dat);
ret.lmax= max (a.lmax, a.sum + b.lmax), ret.rmax= max (b.rmax, b.sum + a.rmax);
return ret;
}
}

static void modify (int rt, int to, long long 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) modify (rt<<1, to, val);
else modify (rt<<1|1, to, val);
update(rt);
}

int main() {
register int _ = read ();
register int x1, y1, x2, y2;
register int n, m;
register node a, b, c;
register long long tmp;
register char opt;
while (_ --)
{
n = read ();//, m = read ();
build (1, 1, n);
m = read ();
while (m --)
{
//opt = 'z';
//while ((opt ^ 'C') && (opt ^ 'Q')) opt = gc();
//if (opt ^ 'C')
{
x1 = read (), y1 = read (), x2 = read (), y2 = read ();
if (y1<x1) swap(x1,y1); if (y2<x2) swap(x2,y2);
if (x1>y2) swap(x1,x2), swap(y1,y2);
if (y1 < x2) {
writelen (max(query(1,x1,y1-1).rmax, 0) + query(1,y1,x2).sum + max(query(1,x2+1,y2).lmax, 0));
} else {
a = query (1, x2, y1), b = query(1,x1,x2-1), c = query(1,y1+1,y2);
tmp = a.dat;
tmp = max (tmp, a.lmax + b.rmax);
tmp = max (tmp, c.lmax + a.rmax);
tmp = max (tmp, a.sum + max(0, b.rmax) + max(0, c.lmax));
writelen (tmp);
}
} //else {x1 = read (), tmp = read (); modify (1, x1, tmp);}
}
}


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号