LOJ 6008 网络流

一开始我在思考为什么不能直接从一天的开始连一条边到一天的结束，而要分别从源点和汇点连，后来我发现如果这样连的话，如果有一条被送去干洗的餐巾一定会导致总流量的减少，但是我们求的是最大流情况下的最小费用，所以要分别从源点与汇点连接。
详细的解释

#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 3010
#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 n, P, M, F, nn, S;
int need[N];
int X[N], Y[N];
int main() {
    int i, j, x, y, w;
    init();  //注意
    s = 0, t = 3;
    scanf("%d%d%d%d%d%d", &n, &P, &M, &F, &nn, &S);
    s = 0;
    t = 2 * n + 1;
    for (i = 1; i <= n; i++) {
        X[i] = i * 2 - 1;
        Y[i] = i * 2;
        scanf("%d", &need[i]);
    }
    for (i = 1; i <= n; i++) {
        addedge(s, X[i], need[i], 0);
        addedge(s, Y[i], INF, P);
        addedge(Y[i], t, need[i], 0);
        if (i + 1 <= n) {
            addedge(X[i], X[i + 1], INF, 0);
        }
        if (i + M <= n) {
            addedge(X[i], Y[i + M], INF, F);
        }
        if (i + nn <= n) {
            addedge(X[i], Y[i + nn], INF, S);
        }
    }
    ll q = Mincost();
    printf("%lld\n", q);
    return 0;
}