UVA 11613 Acme Corporation

           费用流。需要把每个月拆成两个点，一个作为生产点，一个作为销售点，需要注意的是求费用流的时候，当最小费用大于零就停止增广。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<stack>
#include<cmath>
#include<set>
#include<map>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))

using namespace std;
const int maxn = 300;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow, cost;
    Edge() {}
    Edge(int from, int to, int cap, int flow, int cost)
        :from(from), to(to), cap(cap), flow(flow), cost(cost){}
};

struct MCMF
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    int inq[maxn], d[maxn];
    int p[maxn], a[maxn];

    void init(int n)
    {
        this->n = n;
        for(int i = 0; i < n; i ++)
            G[i].clear();
        edges.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 spfa(int s, int t, int &flow, LL &cost)
    {
        for(int i = 0; i < n; i ++) d[i] = INF;
        CLR(inq, 0);
        d[s] = 0; inq[s] = 1; 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] = 1;
                    }
                }
            }
        }
        if(d[t] > 0) return false;///here!!
        flow += a[t];
        cost += (LL)d[t] * a[t];
        int u = t;
        while(u != s)
        {
            edges[p[u]].flow += a[t];
            edges[p[u]^1].flow -= a[t];
            u = edges[p[u]].from;
        }
        return true;
    }
    LL Mincost(int s, int t)
    {
        int flow = 0;LL cost = 0;
        while(spfa(s, t, flow, cost));
        return cost;
    }
}sol;

int main()
{
    int T, M, I, cas = 1;
    scanf("%d", &T);
    while(T --)
    {
        scanf("%d%d", &M, &I);
        sol.init(M * 2 + 2);
        int ss = M * 2, tt = ss + 1;
        for(int i = 0; i < M; i ++)
        {
            int m, n, p, s, e;
            scanf("%d%d%d%d%d", &m, &n, &p, &s, &e);
            sol.AddEdge(ss, i, n, m);
            for(int j = 0; j <= e && j + i < M; j ++)
            {
                sol.AddEdge(i, M + i + j, INF, j * I);
            }
            sol.AddEdge(i + M, tt, s, -p);
        }
        printf("Case %d: %lld\n", cas ++, -sol.Mincost(ss, tt));
    }
}