POJ 3680 最小（大？）费用流

给的点数值比较大，不好直接建网络流，应该先离散化。
离散化之后，对于每个可以选的区间，我们都从左端点到右端点连一条容量为1（因为一个区间只能选一次），权值为-w（只要选择了这条边就能获得-w的权值，便于日后取最大）的边，然后对于1到m-1的每个点，都跟他后面的点连一条容量为k（最多可能叠加k层），权值为0（走这些边就说明什么都没选，也就没有权值）的边，然后从源点s到1连一条容量为k（还是限制叠加次数），权值为0的边，在从最后一个点到终点t也连一条容量为k，权值为0的边，然后求最小费用流，再取负值就能得到最大。

#include<iostream>
#include<math.h>
#include<iomanip>
#include <string>
#include <cstdio>
#include<stdio.h>
#include <cstring>
#include <algorithm>
#include <queue>
#include<vector>
#define INF 0x3f3f3f3f
#define N 1010
#define ll long long
using namespace std;int stop;
struct Edge{
    int from,to,cap,flow,cost;
    Edge(int a=0,int b=0,int c=0, int d=0,int e = 0){
        from = a,to = b,cap = c,flow = d,cost = e;
    }
};
vector<Edge>edges;
vector<int>G[N];
int s,t;
void addedge(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 inq[N];
int dis[N],pre[N],a[N];

void init(){
    for(int i=0;i<N;i++){
        G[i].clear();
    }
    edges.clear();
}

bool spfa(int &flow,ll &cost){
    memset(dis,0x3f,sizeof(dis));
    memset(inq,0,sizeof(inq));
    dis[s] = 0;inq[s] = 1;pre[s] = 0;a[s] = INF;//pre用来保存到达该节点的弧
    queue<int>Q;
    Q.push(s);
    int u;
    while (!Q.empty())
    {
        u = Q.front();Q.pop();
        inq[u] = 0;
        for(int i = 0; i < G[u].size(); 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(!inq[e.to]){
                    inq[e.to] = 1;
                    Q.push(e.to);
                }
            }
        }
    }
    if(dis[t] == INF){
        return 0;
    }
    u = t;
    flow += a[t];
    cost += dis[t]*a[t];
    while (u != s)
    {
        edges[pre[u]].flow += a[t];
        edges[pre[u]^1].flow -= a[t];
        u = edges[pre[u]].from;
    }
    return true;
}

ll Mincost(){
    int flow = 0;
    ll cost = 0;
    while (spfa(flow,cost));
    return cost;
}
int cases;
int n,k;
int ar[N],br[N],c[N],num[N<<1];
int main()
{
    int i,j,x,y,w;
    scanf("%d",&cases);
    while (cases>0)
    {
        cases--;
        memset(ar,0,sizeof(ar));
        memset(br,0,sizeof(br));
        memset(c,0,sizeof(c));
        memset(num,0,sizeof(num));
        init();
        scanf("%d%d",&n,&k);
        int cnt = 0;
        for(i=1;i<=n;i++){
            scanf("%d%d%d",&x,&y,&w);
            ar[i] = x;br[i] = y;c[i] = w;
            num[cnt++] = x;
            num[cnt++] = y;
        }
        sort(num,num+cnt);
        cnt = unique(num,num+cnt) - num;
        s = 0;t = cnt+1;
        addedge(0,1,k,0);
        addedge(t-1,t,k,0);
        for(i=1;i<=n;i++){
            ar[i] = lower_bound(num,num+cnt,ar[i]) - num + 1;
            br[i] = lower_bound(num,num+cnt,br[i]) - num + 1;
            addedge(ar[i],br[i],1,-c[i]);
        }
        for(i=1;i<cnt;i++){
            addedge(i,i+1,k,0);
        }
        ll p = -Mincost();
        printf("%lld\n",p);
    }
    
    return 0;
}