ACM-ICPC 2018 焦作赛区网络预赛 （区间k覆盖问题）

题意

T组测试数据，现在有N个点，每个点最多被选择k次，共有M条边。然后输入M条边u->v权值为w。问可以获得的最大的权值是多少？

 

思路

区间k覆盖问题。

一定要离散化！！！不离散化，边太多了，会超时。

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow, cost;       //起点,终点,容量,流量,花费
    Edge(int u, int v, int c, int f, int w):from(u), to(v), cap(c), flow(f), cost(w) {}
};
struct MCMF
{
    int n, m;                //结点数,边数(包括反向弧),源点s,汇点t
    vector<Edge> edges;            //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];           //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    bool inq[MAXN];                //是否在队列中
    int d[MAXN];                   //Bellman-Ford
    int p[MAXN];                   //上一条弧
    int a[MAXN];                   //可改进量

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

    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));
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }

    bool BellmanFord(int s, int t, int &flow, long long& cost)//SPFA
    {
        for (int i = 0; i <= n; i++) d[i] = INF;
        memset(inq, 0, sizeof(inq));
        d[s] = 0; inq[s] = true; p[s] = 0; a[s] = INF;

        queue<int> Q;
        Q.push(s);
        while (!Q.empty())
        {
            int 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 && d[e.to] > d[u] + e.cost)
                {
                    d[e.to] = d[u] + e.cost;
                    p[e.to] = G[u][i];
                    a[e.to] = min(a[u], e.cap - e.flow);
                    if (!inq[e.to]) { Q.push(e.to); inq[e.to] = true; }
                }
            }
        }
        if (d[t] == INF) return false;
        flow += a[t];
        cost += (long long)d[t] * (long long)a[t];
        for (int u = t; u != s; u = edges[p[u]].from)
        {
            edges[p[u]].flow += a[t];
            edges[p[u]^1].flow -= a[t];
        }
        return true;
    }

    int MinCostMaxFlow(int s, int t, long long& cost)
    {
        int flow = 0; cost = 0;
        while (BellmanFord(s, t, flow, cost));
        return flow;
    }

}solve;

int n, k, m, u[MAXN], v[MAXN], w[MAXN], a[MAXN];

int main()
{
    int T; scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d%d", &n, &k, &m);
        for (int i = 0; i < m; i++)
        {
            scanf("%d%d%d", &u[i], &v[i], &w[i]);
            a[i*2] = u[i];
            a[i*2+1] = ++v[i];
        }
        sort(a, a+m*2);//排序
        int s = 0, t = m*2;
        solve.init(t);
        for (int i = 0; i < m; i++)//离散化建边
        {
            int l = lower_bound(a, a+m*2, u[i])-a;
            int r = lower_bound(a, a+m*2, v[i])-a;
            solve.AddEdge(l, r, 1, -w[i]);
        }
        for (int i = 0; i < 2*m; i++) solve.AddEdge(i, i+1, k, 0);//相邻点建边
        long long cost = 0;
        int Max_Flow = solve.MinCostMaxFlow(s, t, cost);
        printf("%lld\n", -cost);
    }
    return 0;
}

/*
4
10 1 3
1 2 2
2 3 4
3 4 8
10 1 3
1 3 2
2 3 4
3 4 8
100000 1 3
1 100000 100000
1 2 3
100 200 300
100000 2 3
1 100000 100000
1 150 301
100 200 300
*/