2012年10月19日
POJ 1815 Friendship 最小割 + 字典序输出割点
View Code #include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define maxn 410#define maxm 40003#define inf 1000000000int min(int a, int b){ return a < b ? a : b;}struct E{ int v, next, c;}edge[maxm];int head[maxn], tot;int n, m;void add(int s, int t, int c Read More
posted @ 2012-10-19 22:34 To be an ACMan Views(226) Comments(0) Diggs(0)