POJ 1459 Power Network （最大流）

题意：n个结点，np个发电站，nc个消费者，m个电力运输线。接下去是m条边的信息(u,v)cost，cost表示边(u,v)的最大流量；np个发电站的信息(u)cost，cost表示发电站u能提供的最大流量；nc个用户的信息(v)cost，cost表示每个用户v能接受的最大流量。求最大流。

题解：最大流
按照题目意思建边就可以了，注意输入，结点是从0开始标号的。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
/*
 * SAP 邻接矩阵形式
 * 点的编号从 0 开始
 * 增加个 flow 数组，保留原矩阵 maze, 可用于多次使用最大流
 */
const int MAXN = 110;
int maze[MAXN][MAXN];
int gap[MAXN], dis[MAXN], pre[MAXN], cur[MAXN];
int flow[MAXN][MAXN];//存最大流的流量
int sap(int start, int end, int nodenum) {
    memset(cur, 0, sizeof(cur));
    memset(dis, 0, sizeof(dis));
    memset(gap, 0, sizeof(gap));
    memset(flow, 0, sizeof(flow));
    int u = pre[start] = start, maxflow = 0, aug = -1;
    gap[0] = nodenum;
    while (dis[start] < nodenum) {
    loop:
        for (int v = cur[u]; v < nodenum; v++)
            if (maze[u][v] - flow[u][v] && dis[u] == dis[v] + 1) {
                if (aug == -1 || aug > maze[u][v] - flow[u][v]) aug = maze[u][v] - flow[u][v];
                pre[v] = u;
                u = cur[u] = v;
                if (v == end) {
                    maxflow += aug;
                    for (u = pre[u]; v != start; v = u, u = pre[u]) {
                        flow[u][v] += aug;
                        flow[v][u] -= aug;
                    }
                    aug = -1;
                }
                goto loop;
            }
        int mindis = nodenum - 1;
        for (int v = 0; v < nodenum; v++)
            if (maze[u][v] - flow[u][v] && mindis > dis[v]) {
                cur[u] = v;
                mindis = dis[v];
            }
        if ((--gap[dis[u]]) == 0) break;
        gap[dis[u] = mindis + 1]++;
        u = pre[u];
    }
    return maxflow;
}
int n, np, nc, m;
int main() {
    while (~scanf("%d%d%d%d", &n, &np, &nc, &m)) {
        memset(maze, 0, sizeof(maze));
        for (int i = 1; i <= m; i++) {
            int x, y, co;
            char ch = getchar();
            while (ch != '(') ch = getchar();
            scanf("%d,%d)%d", &x, &y, &co);
            maze[x + 1][y + 1] = co;
        }
        for (int j = 1; j <= np; j++) {
            int x, co;
            char ch = getchar();
            while (ch != '(') ch = getchar();
            scanf("%d)%d", &x, &co);
            maze[0][x + 1] = co;
        }
        for (int j = 1; j <= nc; j++) {
            int x, co;
            char ch = getchar();
            while (ch != '(') ch = getchar();
            scanf("%d)%d", &x, &co);
            maze[x + 1][n + 1] = co;
        }
        printf("%d\n", sap(0, n + 1, n + 2));
    }
	return 0;
}