【cdoj 1352】柱爷抢银行MkⅣ

用线段树维护区间最大值，前几次写WA了，原因是在线段树的更新函数中，误以为可以从前面的格子到现在（如果有重复）格子再到现在格子，原来不行。所以把+=改为=，还是蛮简单的，以后这种错误不能再犯了

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 200020
#define ll long long 
#define ls u<<1,l,mid
#define rs u<<1|1,mid+1,r
using namespace std;
ll n,c[maxn*4],cur[maxn],cnt;

struct node{
	ll x,v,y,nx;
}nod[maxn];

bool cmp(ll a,ll b){return a<b;}

struct TREE{
	ll l,r,Max;
}tree[maxn*4];

void build(ll u,ll l,ll r){
	tree[u].l=l,tree[u].r=r,tree[u].Max=0;
	if(l==r)return;
	ll mid=(l+r)>>1;
	build(ls);
	build(rs);
}

void push_up(ll u){
	tree[u].Max=max(tree[u<<1].Max,tree[u<<1|1].Max);
}
void updata(ll u,ll l,ll r,ll x,ll add){
	if(l==r){
		tree[u].Max=add;
		return;
	}
	ll mid=l+r>>1;
	if(x>mid)updata(rs,x,add);
	else updata(ls,x,add);
	push_up(u);
}
ll query(ll u,ll l,ll r,ll x,ll y){
	if(l==x&&r==y)return tree[u].Max;
	ll mid=l+r>>1;
	if(x>mid)query(rs,x,y);
	else if(y<=mid)query(ls,x,y);
	else return max(query(ls,x,mid),query(rs,mid+1,y));
}

ll find(ll x){
	ll l=1,r=cnt;
	while(l<r){
		ll mid=(l+r)>>1;
		if(cur[mid]>=x)r=mid;
		else l=mid+1;
	}
	return l;
}
ll ans=-1e9;
void solve(){
	for(ll i=1;i<=n;i++){
		ll to=nod[i].x-nod[i].y;
		ll x=find(to);
		ll Max;
		Max=nod[i].v;
		Max+=query(1,1,cnt,x,nod[i].nx);
		updata(1,1,cnt,nod[i].nx,Max);
		ans=max(ans,query(1,1,cnt,nod[i].nx,nod[i].nx));
	}
	printf("%lld",ans);
}

int main(){

	scanf("%lld",&n);
	for(ll i=1;i<=n;i++){
		scanf("%lld%lld%lld",&nod[i].x,&nod[i].v,&nod[i].y);
		cur[i]=nod[i].x;
	}
	sort(cur+1,cur+1+n,cmp);
	cnt=unique(cur+1,cur+1+n)-cur-1;
	build(1,1,cnt);
	for(ll i=1;i<=n;i++)nod[i].nx=lower_bound(cur+1,cur+1+cnt,nod[i].x)-cur;
	solve();
	return 0;
}