题意:
给定一个序列和m个询问, 每次询问左端点在[x1,y1],右端点在[x2,y2]的最大连续子段和。
思路:
还是用线段树跟GSS1差不多的搞,如果两个区间不相交的话,就求出[x1,y1]的右连续和[x2,y2]的左连续, 再加上中间的区间和。
如果相交的话, 需要求出[x2,y1]的最大连续子段和,[x2,y1]的左连续加上[y1+1,y2]的右连续,[x1,x2-1]的左连续加上[x2,y2]的右连续。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 100020
#define ls (i << 1)
#define rs (ls | 1)
#define md ((ll + rr) >> 1)
int n, sum[N*4], lx[N*4], rx[N*4], mx[N*4];
int s[N];
void push_up(int i) {
sum[i] = sum[ls] + sum[rs];
mx[i] = max(max(mx[ls], mx[rs]), rx[ls] + lx[rs]);
lx[i] = max(lx[ls], sum[ls] + lx[rs]);
rx[i] = max(rx[rs], sum[rs] + rx[ls]);
}
void build(int ll, int rr, int i) {
if(ll == rr) {
scanf("%d", &sum[i]);
s[ll] = s[ll-1] + sum[i];
mx[i] = lx[i] = rx[i] = sum[i];
return;
}
build(ll, md, ls);
build(md + 1, rr, rs);
push_up(i);
}
int ql(int l, int r, int ll, int rr, int i) {
if(l > r) return 0;
if(ll == l && rr == r) return lx[i];
if(r <= md) return ql(l, r, ll, md, ls);
if(l > md) return ql(l, r, md + 1, rr, rs);
return max(ql(l, md, ll, md, ls), s[md] - s[l-1] + ql(md + 1, r, md + 1, rr, rs));
}
int qr(int l, int r, int ll, int rr, int i) {
if(l > r) return 0;
if(ll == l && rr == r) return rx[i];
if(r <= md) return qr(l, r, ll, md, ls);
if(l > md) return qr(l, r, md + 1, rr, rs);
return max(qr(md + 1, r, md + 1, rr, rs), s[r] - s[md] + qr(l, md, ll, md, ls));
}
int query(int l, int r, int ll, int rr, int i) {
if(l > r) return 0;
if(ll == l && rr == r) return mx[i];
if(r <= md) return query(l, r, ll, md, ls);
if(l > md) return query(l, r, md + 1, rr, rs);
int R = qr(l, md, ll, md, ls);
int L = ql(md + 1, r, md + 1, rr, rs);
return max(L + R, max(query(l, md, ll, md, ls), query(md + 1, r, md + 1, rr, rs)));
}
int main() {
//freopen("tt.txt", "r", stdin);
int cas;
scanf("%d", &cas);
while(cas--) {
scanf("%d", &n);
s[0] = 0;
build(1, n, 1);
int m;
scanf("%d", &m);
while(m--) {
int op, x, y, xx, yy;
scanf("%d%d%d%d", &x, &y, &xx, &yy);
if(xx > y) {
int t = s[xx-1] - s[y];
t += qr(x, y, 1, n, 1);
t += ql(xx, yy, 1, n, 1);
printf("%d\n", t);
}
else {
int t = query(xx, y, 1, n, 1);
t = max(t, ql(y + 1, yy, 1, n, 1) + qr(xx, y, 1, n, 1));
t = max(t, ql(xx, y, 1, n, 1) + qr(x, xx - 1, 1, n, 1));
t = max(t, ql(y + 1, yy, 1, n, 1) + qr(x, xx - 1, 1, n, 1) + s[y] - s[xx-1]);
printf("%d\n", t);
}
}
}
return 0;
}