ACM-ICPC 2018 焦作赛区网络预赛 F. Modular Production Line

题意呃……其实就是最长可重复区间，网络流二十四题之二十一题的建模方法直接套用到这里，我们直接替换一下费用就行了，记得右端点要加一

#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#define ll long long
using namespace std;
const int MAXN = 200000;
const int MAXM = 400000;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int to,next,cap,flow,cost;
} edge[MAXM];
int head[MAXN],tol;
int pre[MAXN],dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1
void init(int n)
{
    N = n;
    tol = 0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
bool spfa(int s,int t)
{
    queue<int>q;
    for(int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(edge[i].cap > edge[i].flow &&
                    dis[v] > dis[u] + edge[i].cost )
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if(pre[t] == -1)
        return false;
    else
        return true;
}
//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s,int t,ll &cost)
{
    int flow = 0;
    cost = 0;
    while(spfa(s,t))
    {
        int Min = INF;
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            if(Min > edge[i].cap - edge[i].flow)
                Min = edge[i].cap - edge[i].flow;
        }
        for(int i = pre[t]; i != -1; i = pre[edge[i^1].to])
        {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += edge[i].cost * Min;
        }
        flow += 1LL*Min;
    }
    return flow;
}
struct node
{
    int r,l,len,w;
} seg[2001];
int cmp(node a,node b)
{
    if(a.l == b.l)
        return a.r < b.r;
    return a.l < b.l;
}
int main()
{
    int ca;
    scanf("%d",&ca);
    vector<int> ha;
    while(ca--)
    {
        ha.clear();
        int n,k,m;
        scanf("%d%d%d",&n,&k,&m);
        for(int i = 1; i<=m; i++)
        {
            scanf("%d%d%d",&seg[i].l,&seg[i].r,&seg[i].w);
            seg[i].r+=1;
            ha.push_back(seg[i].l);
            ha.push_back(seg[i].r);
        }
        sort(ha.begin(),ha.end());
        ha.erase(unique(ha.begin(),ha.end()),ha.end());
        int num = ha.size();
        int st = num,en = num+1;
        init(en+5);
        for(int i = 1;i<num;i++)
        {
            addedge(i-1,i,k,0);
        }
        for(int i = 1;i<=m;i++)
        {
            int l = lower_bound(ha.begin(),ha.end(),seg[i].l) - ha.begin();
            int r = lower_bound(ha.begin(),ha.end(),seg[i].r) - ha.begin();
            addedge(l,r,1,-seg[i].w);
        }
        addedge(st,0,k,0);
        addedge(num-1,en,k,0);
        ll cost;
        minCostMaxflow(st,en,cost);
        printf("%lld\n",-cost);
    }

    return 0;
}