bzoj1218 [HNOI2003]激光炸弹(二维前缀和+暴力/线段树+离散化+扫描线)

n=5000，暴力O(n^2)预处理二维前缀和，暴力O(n^2)枚举答案矩阵。
当然正解是O(nlogn)的线段树+扫描线+离散化的老套路。。详见poj2482

暴力版

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 5010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int sum[N][N],n,r,ans=0;
int main(){
//  freopen("a.in","r",stdin);
    n=read();r=read();
    while(n--){
        int x=read()+1,y=read()+1,val=read();sum[x][y]+=val;
    }
    for(int i=1;i<=5000;++i)
        for(int j=1;j<=5000;++j)
            sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
    for(int i=1;i+r-1<=5000;++i)
        for(int j=1;j+r-1<=5000;++j)
            ans=max(ans,sum[i+r-1][j+r-1]-sum[i-1][j+r-1]-sum[i+r-1][j-1]+sum[i-1][j-1]);
    printf("%d\n",ans);
    return 0;
}

线段树+扫描线版

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 20010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,r,aa[N],num,m,ans;
struct Lines{
    int x,y1,y2,val;
}a[N];
struct node{
    int mx,add;
}tree[N<<2];
inline bool cmp(Lines x,Lines y){
    return x.x==y.x?x.val>y.val:x.x<y.x;
}
inline void pushup(int p){
    tree[p].mx=max(tree[p<<1].mx,tree[p<<1|1].mx);
}
inline void pushdown(int p){
    if(!tree[p].add) return;
    tree[p<<1].add+=tree[p].add;tree[p<<1|1].add+=tree[p].add;
    tree[p<<1].mx+=tree[p].add;tree[p<<1|1].mx+=tree[p].add;
    tree[p].add=0;
}
void build(int p,int l,int r){
    tree[p].add=tree[p].mx=0;
    if(l==r) return;
    int mid=l+r>>1;
    build(p<<1,l,mid);build(p<<1|1,mid+1,r);
}
void change(int p,int l,int r,int x,int y,int val){
    if(x<=l&&r<=y){tree[p].add+=val;tree[p].mx+=val;return;}
    int mid=l+r>>1;pushdown(p);
    if(x<=mid) change(p<<1,l,mid,x,y,val);
    if(y>mid) change(p<<1|1,mid+1,r,x,y,val);
    pushup(p);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();r=read();
    while(n--){
        int x=read(),y=read(),val=read();
        a[++num].x=x;a[num].y1=y;a[num].y2=y+r-1;a[num].val=val;
        a[++num].x=x+r-1;a[num].y1=y;a[num].y2=y+r-1;a[num].val=-val;
        aa[++m]=y;aa[++m]=y+r-1;
    }sort(aa+1,aa+m+1);m=unique(aa+1,aa+m+1)-aa-1;
    sort(a+1,a+num+1,cmp);build(1,1,m);
    for(int i=1;i<=num;++i){
        change(1,1,m,lower_bound(aa+1,aa+m+1,a[i].y1)-aa,lower_bound(aa+1,aa+m+1,a[i].y2)-aa,a[i].val);
        ans=max(ans,tree[1].mx);
    }
    printf("%d\n",ans);
    return 0;
}