hdu 3549 Flow Problem 基本网络流。
摘要:
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <deque>using namespace std;int cap[100][100];int a[100];int flow[100][100];int path[1010];int N,M;const int inf = 0x7f7f7f7f;int f;void BFS( ){ int i, j, k, t, u, v; f = 0; memset(flow, 0, sizeof(flow)); for (; 阅读全文
posted @ 2011-08-08 09:30 more think, more gains 阅读(170) 评论(0) 推荐(0) 编辑