差分约束 Intervals

 

#include <iostream>
#include <bits/stdc++.h>
#define inf 9999999
#define maxn 1110000
using namespace std;
int dis[maxn];
bool vis[maxn];
int maxx,minn;
struct edge
{
	int u,v,w;
	int next;
}e[3*maxn];
int tot;
int head[maxn];
inline void clear()
{
	memset(vis,0,sizeof(vis));
	minn=inf;
	maxx=-inf;
}
inline void add(int u,int v,int w)
{
	e[++tot]=(edge){u,v,w,head[u]};
	head[u]=tot;
}
inline void init()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		add(a,b+1,c);
		minn=min(minn,a);
		maxx=max(maxx,b+1);
	}
	for(int i=minn;i<maxx;i++)
	{
		add(i,i+1,0);
		add(i+1,i,-1);
	}
}
inline void spfa(int x)
{
	for(int i=minn;i<=maxx;i++) dis[i]=-inf;
	queue <int> q;
	q.push(x);
	vis[x]=1;
	dis[x]=0;
	while(!q.empty())
	{
		int from=q.front();
		q.pop();
		vis[from]=0;
		for(int i=head[from];i;i=e[i].next)
		{
			int to=e[i].v;
			if(dis[to]<dis[from]+e[i].w)
			{
				dis[to]=dis[from]+e[i].w;
				if(!vis[to])
				{
					q.push(to);
					vis[to]=1;
				}
			}
		}
	}
}
inline void solve()
{
	spfa(minn);
}
int main()
{	
	clear();
	init();
	solve();
	cout<<dis[maxx];
}