POJ2914 Minimum Cut 【全局最小割Stoer-Wagner模板题】
题目链接显然裸的全局最小割//O(n^3)#include<stdio.h>#include<iostream>#include<algorithm>#include<stdlib.h>#include<string.h>//#include<bits/stdc++.h>#define ll long long#define pii pair<int,int>#define pll
原创
2017-08-05 21:41:06 ·
710 阅读 ·
0 评论