题意:
给出一些数,一些询问,每次询问一段区间内最大的子段和是多少。
无修改的小白逛公园...
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 50005, inf = 0x3f3f3f3f;
int n, m, tr[maxn << 2], trl[maxn << 2], trr[maxn << 2], sum[maxn << 2];
struct data {
int max, lmax, rmax, sum;
};
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline void pushup(int p) {
tr[p] = max(max(tr[p << 1], tr[p << 1 | 1]), trr[p << 1] + trl[p << 1 | 1]);
trl[p] = max(trl[p << 1], sum[p << 1] + trl[p << 1 | 1]);
trr[p] = max(trr[p << 1 | 1], trr[p << 1] + sum[p << 1 | 1]);
sum[p] = sum[p << 1] + sum[p << 1 | 1];
}
void build(int p, int l, int r) {
if(l == r) {
tr[p] = trl[p] = trr[p] = sum[p] = iread();
return;
}
int mid = l + r >> 1;
build(p << 1, l, mid); build(p << 1 | 1, mid + 1, r);
pushup(p);
}
data query(int p, int l, int r, int x, int y) {
if(x <= l && r <= y)
return (data){tr[p], trl[p], trr[p], sum[p]};
int mid = l + r >> 1;
if(y <= mid) return query(p << 1, l, mid, x, y);
else if(x > mid) return query(p << 1 | 1, mid + 1, r, x, y);
else {
data L = query(p << 1, l, mid, x, mid), R = query(p << 1 | 1, mid + 1, r, mid + 1, y), res;
res.max = max(max(L.max, R.max), L.rmax + R.lmax);
res.lmax = max(L.lmax, L.sum + R.lmax);
res.rmax = max(R.rmax, R.sum + L.rmax);
res.sum = L.sum + R.sum;
return res;
}
}
int main() {
n = iread();
for(int i = n << 2; i >= 0; i--) tr[i] = trl[i] = trr[i] = -inf;
build(1, 1, n);
m = iread();
while(m--) {
int a = iread(), b = iread();
printf("%d\n", query(1, 1, n, a, b).max);
}
return 0;
}