洛谷P1251 餐巾計劃問題(最小費用最大流)

題意

一家餐廳，第$i$天需要$r_i$塊餐巾，每天獲取餐巾有三種途徑

1、以$p$的費用買

2、以$f$的費用送到快洗部，併在$m$天後取出

3、以$s$的費用送到慢洗部，併在$n$天後取出

問滿足要求時的最小費用

Sol

一道非常不錯的網路流，應該不難看出是費用流。

首先進行拆點，把每個點早上和晚上，然後進行連邊

從$S$向i連邊$(0, r_i)$，表示到了晚上有$r_i$塊臟餐巾

從$i'$向$T$連邊$(0, r_i)$，表示早上有$r_i$塊新餐巾

從$S$向$i'$連邊$(p, INF)$，表示每天早上可以以$p$的費用無限提供餐巾

從$i$向$i'$連邊$(0, INF)$，表示每天晚上的臟餐巾可以留到第二天晚上

從$i$向$i' + m$連邊$(f, INF)$，表示快洗

從$i$向$i' + n$連邊$(s, INF)$，表示慢洗

這樣既可以保證每天的$r_i$滿足要求，又能保證最小費用。so nice

#include<cstdio>
#include<cstring>
#include<queue>
#define LL long long 
using namespace std;
const int MAXN = 1e5 + 10, INF = 1e9 + 10;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int N, S, T;
int r[MAXN], p, m, f, n, s;
struct Edge {
    int u, v, w, f, nxt;
}E[MAXN];
int head[MAXN], num;
inline void add_edge(int x, int y, int w, int f) {
    E[num] = (Edge){x, y, w, f, head[x]};
    head[x] = num++;
}
inline void AddEdge(int x, int y, int w, int f) {
    add_edge(x, y, w, f);
    add_edge(y, x, -w, 0);
}
int dis[MAXN], vis[MAXN], Pre[MAXN];
bool SPFA() {
    memset(dis, 0x3f, sizeof(dis));
    memset(vis, 0, sizeof(vis));
    queue<int> q; dis[S] = 0; q.push(S);
    while(!q.empty()) {
        int p = q.front(); q.pop(); vis[p] = 0;
        for(int i = head[p]; i != -1; i = E[i].nxt) {
            int to = E[i].v;
            if(dis[to] > dis[p] + E[i].w && E[i].f) {
                dis[to] = dis[p] + E[i].w;
                Pre[to] = i;
                if(!vis[to]) vis[to] = 1, q.push(to);
            }
        }
    }
    return dis[T] <= INF;
}
LL F() {
    LL nowflow = INF;
    for(int i = T; i != S; i = E[Pre[i]].u) nowflow = min(nowflow, (LL)E[Pre[i]].f);
    for(int i = T; i != S; i = E[Pre[i]].u) E[Pre[i]].f -= nowflow, E[Pre[i] ^ 1].f += nowflow;
    return nowflow * dis[T];
}
LL MCMF() {
    LL ans = 0;
    while(SPFA()) 
        ans += F();
    return ans;
}
int main() {
    memset(head, -1, sizeof(head));
    N = read(); 
    S = 0; T = 2 * N + 1;
    for(int i = 1; i <= N; i++) r[i] = read();
    p = read(); m = read(); f = read(); n = read(); s = read();
    for(int i = 1; i <= N; i++) AddEdge(S, i, 0, r[i]);
    for(int i = 1; i <= N; i++) AddEdge(S, i + N, p, INF);
    for(int i = 1; i <= N; i++) AddEdge(i + N, T, 0, r[i]);
    for(int i = 1; i <= N; i++) {
        if(i + m <= N) AddEdge(i, i + N + m, f, INF);        
        if(i + n <= N) AddEdge(i, i + N + n, s, INF);
        if(i + 1 <= N) AddEdge(i, i + 1, 0, INF);
    }
    printf("%lld", MCMF());
}