洛谷 P1251 餐巾计划问题 题解

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define pii pair<int, int>
#define ll long long
//#define inf 0x3f3f3f3f
using namespace std;
const int N = 5010, M = 500005, inf = 1 << 29;
int n, m, s ,t, tot;
int r[2005];
long long maxflow = 0, ans = 0;
int ver[M], edge[M], cost[M], Next[M], Head[N];
int d[N], incf[N], pre[N], v[N];
void add(int x, int y, int z, int c) {
    //cout << x << " " << y << " "  << z << " " << c << '\n';
	// 正向边，初始容量z，单位费用c
	ver[++tot] = y, edge[tot] = z, cost[tot] = c;
	Next[tot] = Head[x], Head[x] = tot;
	// 反向边，初始容量0，单位费用-c，与正向边“成对存储”
	ver[++tot] = x, edge[tot] = 0, cost[tot] = -c;
	Next[tot] = Head[y], Head[y] = tot;
}
bool spfa() {
	queue<int> q;
	memset(d, 0x3f, sizeof(d)); // INF 计算最大费用流的时候0x3f改为0xcf,即-INF
	memset(v, 0, sizeof(v));
	q.push(s); d[s] = 0; v[s] = 1; pre[t] = -1; // SPFA 求最长路
	incf[s] = 1 << 30; // 增广路上各边的最小剩余容量
	while (q.size()) {
		int x = q.front(); 
        q.pop();
        v[x] = 0; 
		for (int i = Head[x]; i; i = Next[i]) {
			if (!edge[i]) continue; // 剩余容量为0，不在残量网络中，不遍历
			int y = ver[i];
			if (d[y] > d[x] + cost[i]) {//计算最大费用流的时候>改成<
				d[y] = d[x] + cost[i];
				incf[y] = min(incf[x], edge[i]);
				pre[y] = i; // 记录前驱，便于找到最长路的实际方案
				if (!v[y]) v[y] = 1, q.push(y);
			}
		}
	}
	return pre[t] != -1;// 汇点不可达，已求出最大流
	
}
//更新最长增广路及其反向边的剩余容量
void update() {
	int x = t;
	while (x != s) {
		int i = pre[x];
		edge[i] -= incf[t];
		edge[i ^ 1] += incf[t]; // 利用“成对存储”的xor 1技巧
		x = ver[i ^ 1];
	}
	maxflow += incf[t];
	ans += d[t] * incf[t];
}
signed main() {
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    int N, p, mm, f, nn ,ss;
    tot = 1;
    cin >> N;
    s = 2 * N + 1;
    t = s + 1;
    for (int i = 1; i <= N; i++) cin >> r[i];
    cin >> p >> mm >> f >> nn >> ss;
    for (int i = 1; i <= N; i++) {
        add(s, i, r[i], 0);
        add(i + N, t, r[i], 0);
        add(s, i + N, inf, p);
        if (i != N) {
            add(i, i + 1, inf, 0);
        }
        if (i + mm <= N) add(i, i + mm + N, inf, f);
        if (i + nn <= N) add(i, i + nn + N, inf, ss);
    } 
    while (spfa()) update();
    cout << ans << '\n';
    return 0;
}