显然是个最大费用流。
线段树优化建图即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 5010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,m=0,tot=0,h[N*3],num=1,dis[N*3],rt=0,T=15010,ans=0,path[N*3];
bool inq[N*3];
struct edge{
int to,next,w,c;
}data[280000];
struct node{
int lc,rc;
}tr[N<<1];
inline void add(int x,int y,int w,int c){
data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].w=w;data[num].c=c;
data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].w=0;data[num].c=-c;
}
inline void build(int &p,int l,int r){
p=++tot;if(l==r){add(p,T,1,0);return;}int mid=l+r>>1;
build(tr[p].lc,l,mid);build(tr[p].rc,mid+1,r);
add(p,tr[p].lc,inf,0);add(p,tr[p].rc,inf,0);
}
inline void cover(int p,int l,int r,int x,int y){
if(x<=l&&r<=y){add(tot,p,inf,0);return;}int mid=l+r>>1;
if(x<=mid) cover(tr[p].lc,l,mid,x,y);
if(y>mid) cover(tr[p].rc,mid+1,r,x,y);
}
inline bool spfa(){
queue<int>q;memset(path,0,sizeof(path));
memset(dis,128,sizeof(dis));
q.push(0);dis[0]=0;inq[0]=1;
while(!q.empty()){
int x=q.front();q.pop();inq[x]=0;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(!data[i].w) continue;
if(dis[x]+data[i].c>dis[y]){
dis[y]=dis[x]+data[i].c;path[y]=i;
if(!inq[y]) q.push(y),inq[y]=1;
}
}
}return path[T];
}
int main(){
// freopen("a.in","r",stdin);
n=read();build(rt,1,4999);
for(int i=1;i<=n;++i){
int x=read(),y=read()-1,val=read();
add(0,++tot,1,val);cover(rt,1,4999,x,y);
}while(spfa()){
int now=T;ans+=dis[T];
while(path[now]) data[path[now]].w--,data[path[now]^1].w++,now=data[path[now]^1].to;
}printf("%d\n",ans);
return 0;
}