poj3680 Intervals (费用流巧妙的建图)

题意：在实轴上给个N个开区间，每个区间给出一个权值w,要求你选出一些区间（ai,bi）使得这些区间的权值和最大，要求是选出的区间中的每个点不能被覆盖超过k次。（1 <= K <= N <= 200, 1 <= ai < bi <= 100,000, 1 <= wi <= 100,000）

【建模方法】
经典构图题。先将所有区间端点离散化到整数1..M，另加源s=0，汇t=M+1；对每个点i (0 <= i <= M)加边(i, i+1, K, 0)；对每个区间(ai, bi)加边(ai’, bi’, 1, -wi)，其中ai’, bi’分别表示ai, bi离散化后对应的数值。求一次最小费用流再取反即为结果。

#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define MAXN 505
#define LL long long
#define INF 0x3f7f7f7f
const double eps = 1e-10;
struct Edge
{
    int from,to,cap,flow,cost;
    Edge(int from=0,int to=0,int cap=0,int flow=0,int cost=0)
    {
        this->from=from;
        this->to=to;
        this->cap=cap;
        this->flow=flow;
        this->cost=cost;
    }
};
vector<Edge>edges;
vector<int>g[MAXN];
bool vis[MAXN];
int dis[MAXN];
int pre[MAXN];
int a[MAXN];
int s,t;
void init()
{
    for(int i=0;i<MAXN;i++)
    {
        g[i].clear();
    }
    edges.clear();
}
void add(int from,int to,int cap,int cost)
{
    edges.push_back(Edge(from,to,cap,0,cost));
    edges.push_back(Edge(to,from,0,0,-cost));
    int m=edges.size();
    g[from].push_back(m-2);
    g[to].push_back(m-1);
}
bool spfa(int &flow,int &cost)
{
    int i;
    for(i=0;i<MAXN;i++)
        dis[i]=INF;
    memset(vis,0,sizeof(vis));
    queue<int>q;
    q.push(s);
    dis[s]=0;
    vis[s]=1;
    pre[s]=0;
    a[s]=INF;
   while(!q.empty())
   {
       int u=q.front();
       q.pop();
       vis[u]=0;
       int sz=g[u].size();
       for(i=0;i<sz;i++)
       {
           Edge &e=edges[g[u][i]];
           if(e.cap>e.flow&&dis[e.to]>dis[u]+e.cost)
           {
               dis[e.to]=dis[u]+e.cost;
               pre[e.to]=g[u][i];
               a[e.to]=min(a[u],e.cap-e.flow);
               if(!vis[e.to])
               {
                   vis[e.to]=1;
                   q.push(e.to);
               }
           }
       }
   }
   if(dis[t]==INF)
    return false;
   flow+=a[t];
   cost+=dis[t]*a[t];
   int v=t;
   while(v!=s)
   {
       edges[pre[v]].flow+=a[t];
       edges[pre[v]^1].flow-=a[t];
       v=edges[pre[v]].from;
   }
   return true;
}

int minCost()
{
    int flow=0,cost=0;
    while(spfa(flow,cost));
    return cost;
}
struct node
{
    int l,r,w;
    node(int l=0,int r=0,int w=0):l(l),r(r),w(w){}
};
struct node p[MAXN];
int n,k,b[MAXN],fun[100001];
int main()
{
    int i,cas,cnt;
    scanf("%d",&cas);
    while(cas--)
    {
        init();
        cnt=0;
        scanf("%d%d",&n,&k);
        memset(fun,0,sizeof(fun));
        for(i=1;i<=n;i++)
        {
            int l,r,w;
            scanf("%d%d%d",&l,&r,&w);
            if(fun[l]==0)
            {
                b[++cnt]=l;
                fun[l]=1;
            }
            if(fun[r]==0)
            {
                b[++cnt]=r;
                fun[r]=1;
            }
            p[i]=node(l,r,w);
        }
        sort(b+1,b+1+cnt);
        memset(fun,0,sizeof(fun));
        s=1,t=cnt+1;
        for(i=1;i<=cnt;i++)
        {
            add(i,i+1,k,0);
            fun[b[i]]=i;

        }
        for(i=1;i<=n;i++)
        {
            add(fun[p[i].l],fun[p[i].r],1,-p[i].w);
        }
        printf("%d\n",-minCost());

    }
    return 0;
}