这个题建图的时候想了半天,以时间划分区间,每个区间流量为2,然后当前区间连接当前区间的下一个可以开始的起点,费用为申请费用的负值,流量为1。剩下的就是最小费用流 了
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int inf=1<<29;
const int maxn=1100;
const int maxm=maxn*maxn;
struct Apply
{
int st;
int des;
int c;
}s[1100];
int e,st,des,n,head[maxn],pnt[maxm],nxt[maxm],cost[maxm],flow[maxm],dist[maxn],pre[maxn];
int t[maxn*2],cnt;
bool vis[maxn];
queue<int> q;
void AddEdge(int u,int v,int c,int f)
{
pnt[e]=v;nxt[e]=head[u];cost[e]=c;flow[e]=f;head[u]=e++;
pnt[e]=u;nxt[e]=head[v];cost[e]=-c;flow[e]=0;head[v]=e++;
}
bool Spfa()
{
for(int i=st;i<=des;i++)
{
dist[i]=inf;
pre[i]=-1;
}
dist[st]=0;
q.push(st);
while(!q.empty())
{
int u=q.front();
vis[u]=0;
q.pop();
for(int i=head[u];i!=-1;i=nxt[i])
if(flow[i]&&dist[pnt[i]]>dist[u]+cost[i])
{
dist[pnt[i]]=dist[u]+cost[i];
pre[pnt[i]]=i;
if(!vis[pnt[i]])
{
q.push(pnt[i]);
vis[pnt[i]]=1;
}
}
}
return dist[des]!=inf;
}
int mincostflow()
{
int ans=0;
while(Spfa())
{
int mini=inf;
for(int i=pre[des];i!=-1;i=pre[pnt[i^1]])
mini=min(mini,flow[i]);
for(int i=pre[des];i!=-1;i=pre[pnt[i^1]])
{
//printf("%d %d %d\n",pnt[i^1],pnt[i],flow[i]);
flow[i]-=mini;
flow[i^1]+=mini;
}
ans+=mini*dist[des];
}
return -ans;
}
int main()
{
while(scanf("%d",&n)&&n)
{
cnt=0;
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&s[i].st,&s[i].des,&s[i].c);
t[cnt++]=s[i].st;
t[cnt++]=s[i].des;
}
sort(t,t+cnt);
cnt=unique(t,t+cnt)-t;
e=st=0,des=cnt+1;
memset(head,-1,sizeof(head));
for(int i=1;i<=n;i++)
{
int sl=lower_bound(t,t+cnt,s[i].st)-t;
int sr=lower_bound(t,t+cnt,s[i].des)-t+1;
AddEdge(sl,sr,-s[i].c,1);
}
for(int i=1;i<=cnt+1;i++)
AddEdge(i-1,i,0,2);
printf("%d\n",mincostflow());
}
return 0;
}