2019hdu暑假多校训练赛第六场 HDU - 6638 (线段树求最大子段和)

题目传送门

题意：平面内n个点，让你选择平面内一个任意长宽 的矩形，是的矩形内的点的权值和最大

思路：由一维的区间最大字段和联想到这个二维的，这个就可以看做是n*(n-1)/2个  一维区间

枚举x为左边界，对于每一个左边界，枚举他的又边界，对于每一个矩形，建权值线段树，当插入的点的x，不是左边界 的时候，需要进行查询。取最大值就好了

 

#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int maxn = 5e4 + 10;

int n, q, b[maxn], T;

struct Tree {
    int l, r;
    ll sum, maxl, maxr, maxx;
}e[maxn << 2];

struct node{
    int x, y;
    ll w;
}pos[maxn];

bool cmp(node aa, node bb){
    return aa.x < bb.x;
}

inline void pushup(int cur) {
    e[cur].maxx = max(e[cur << 1].maxx, max(e[cur << 1 | 1].maxx, e[cur << 1].maxr + e[cur << 1 | 1].maxl));
    e[cur].maxl = max(e[cur << 1].maxl, e[cur << 1].sum + e[cur << 1 | 1].maxl);
    e[cur].maxr = max(e[cur << 1 | 1].maxr, e[cur << 1 | 1].sum + e[cur << 1].maxr);
    e[cur].sum = e[cur << 1].sum + e[cur << 1 | 1].sum;
}

inline void build (int l, int r, int cur) {
    e[cur].l = l;
    e[cur].r = r;
    e[cur].maxl = e[cur].maxr = e[cur].maxx = e[cur].sum = 0;
    if(l == r) {
        return ;
    }
    int mid = l + r >> 1;
    build(l, mid, cur << 1);
    build(mid + 1, r, cur << 1 | 1);
    pushup(cur);
}

inline void update(int cur, int p, int val) {
    if(e[cur].l == e[cur].r) {
        e[cur].maxl = e[cur].maxr = e[cur].maxx = e[cur].sum = e[cur].sum + val;
        return ;
    }
    int mid = e[cur].l + e[cur].r >> 1;
    if(p <= mid) update(cur << 1, p, val);
    else update(cur << 1 | 1, p, val);
    pushup(cur);
}

inline ll query(int cur) {
    return e[1].maxx;
}

int main()
{
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) {
            scanf("%d %d %lld", &pos[i].x, &pos[i].y, &pos[i].w);
            b[i] = pos[i].y;
        }
        sort(b + 1, b + 1 + n);
        int len = unique(b + 1, b + n + 1) - (b + 1);
        for(int i = 1; i <= n; i++) {
            pos[i].y = lower_bound(b + 1, b + len + 1, pos[i].y) - b;
        }
        sort(pos + 1, pos + n + 1, cmp);
        ll ans = -1e16;
        for(int i = 1; i <= n; i++) {
            if(i != 1 && pos[i].x == pos[i - 1].x) continue;
            build(1, len, 1);
            for(int j = i; j <= n; j++) {
                if(j != i && pos[j].x != pos[j - 1].x)
                    ans = max(ans, query(1));
                update(1, pos[j].y, pos[j].w);
            }
            ans = max(ans, query(1));
        }
        printf("%lld\n", ans);
    }
    return 0;
}