[CODEVS1914] 运输问题（最小费用最大流）

传送门

水题。

建图都不想说了

——代码

1 #include <queue> 2 #include <cstdio> 3 #include <cstring> 4 #include <iostream> 5 #define INF 1e9 6 #define M 101 7 #define N 100001 8 #define min(x, y) ((x) < (y) ? (x) : (y)) 9 10 int n, m, cnt, s, t; 11 int a[M], b[M], map[M][M], dis[N], pre[N]; 12 int head[N], to[N << 1], val[N << 1], cost[N << 1], next[N << 1]; 13 bool vis[N]; 14 15 inline int read() 16 23 24 inline void add(int x, int y, int z, int c) 25 32 33 inline bool spfa() 34 58 } 59 } 60 } 61 return pre[t] ^ 1; 62 } 64 inline int dinic() 65 76 sum += dis[t] * d; 77 } 78 return sum; 79 } 80 81 int main() 82 94 for(i = 1; i <= n; i++) 95 100 for(i = 1; i <= m; i++) 101 for(j = 1; j <= n; j++) 102 107 printf("%d\n", dinic()); 108 cnt = 0; 109 memset(head, 1, sizeof(head)); 110 for(i = 1; i <= m; i++) 111 115 for(i = 1; i <= n; i++) 116 120 for(i = 1; i <= m; i++) 121 for(j = 1; j <= n; j++) 122 126 printf("%d\n", dinic()); 127 return 0; 128 }
View Code

上一篇：[HDU3038]How Many Answers Are Wrong（并查集）

下一篇：[POJ2406]Power Strings

---

最小费用最大流 网络流