【SPOJ】Can you answer these queries I【线段树】

题意：给出一个数列，m次询问，每次询问每一个区间的最大连续和。

思路：显然是道线段树的题目，线段树中保存三个信息：区间最大连续和，左端点开始的最大连续和，右端点开始的最大连续和。我们先预处理出前n项的和记为num[n]，每次Push时根据左区间和右区间来更新整个区间。具体实现方法看代码中，文字不好叙述。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 50004
#define mid (l+r>>1)
#define lc (d<<1)
#define rc (d<<1|1)

struct Tr{
    int ls, rs, s, ans;
}tr[N<<2];

void Push(int d) {
    tr[d].s = tr[lc].s+tr[rc].s;
    tr[d].ls = max(tr[lc].ls, tr[lc].s+tr[rc].ls);
    tr[d].rs = max(tr[rc].rs, tr[rc].s+tr[lc].rs);
    tr[d].ans = max(max(tr[lc].ans, tr[rc].ans), tr[lc].rs+tr[rc].ls);
}

void build(int d, int l, int r) {
    if (l == r) {
        scanf("%d", &tr[d].ans);
        tr[d].ls = tr[d].rs = tr[d].s = tr[d].ans;
        return;
    }
    build(lc, l, mid), build(rc, mid+1, r);
    Push(d);
}

Tr query(int d, int l, int r, int L, int R) {
    if (l == L && r == R) {
        return tr[d];
    }
    if (R <= mid) return query(lc, l, mid, L, R);
    else if (L > mid) return query(rc, mid+1, r, L, R);
    else {
        Tr la = query(lc, l, mid, L, mid), ra = query(rc, mid+1, r, mid+1, R);
        Tr re;
        re.ans = max(la.ans, ra.ans);
        re.s = la.s+ra.s;
        re.ls = max(la.ls, la.s+ra.ls), re.rs = max(ra.rs, ra.s+la.rs);
        re.ans = max(re.ans, la.rs+ra.ls);
        return re;
    }
}

int main() {
    int n, m, l, r, i, j;
    while (~scanf("%d", &n)) {
        build(1, 1, n);
        scanf("%d", &m);
        while (m--) {
            scanf("%d%d", &l, &r);
            printf("%d\n", query(1, 1, n, l, r).ans);
        }
    }
}