题意:
求无向图的最小割。
解析:
代码:
#pragma comment(linker, "/STACK:1677721600")
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <algorithm>
#define pb push_back
#define mp make_pair
#define LL long long
#define lson lo,mi,rt<<1
#define rson mi+1,hi,rt<<1|1
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a,b) memset(a,b,sizeof(a))
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)
using namespace std;
const int mod = 100000;
const double eps = 1e-8;
const double ee = exp(1.0);
const int inf = 0x3f3f3f3f;
const int maxn = 500 + 10;
const double pi = acos(-1.0);
const LL iinf = 0x3f3f3f3f3f3f3f3f;
int readT()
{
char c;
int ret = 0,flg = 0;
while(c = getchar(), (c < '0' || c > '9') && c != '-');
if(c == '-') flg = 1; else ret = c ^ 48;
while( c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c ^ 48);
return flg ? - ret : ret;
}
int g[maxn][maxn];
int v[maxn]; //v[i]代表节点i合并到的顶点
int w[maxn]; //定义w(A, x) = ∑w(v[i],x),v[i]∈A
bool vis[maxn]; //用来标记是否该点加入了A集合
int stoerWagner(int n)
{
int minCut = inf;
for (int i = 0; i < n; ++i)
{
v[i] = i; // 初始还未合并,都代表节点本身
}
while (n > 1)
{
int pre = 0; // pre用来表示之前加入A集合的点(在t之前一个加进去的点)
mem0(vis);
mem0(w);
for (int i = 1; i < n; ++i)
{
int k = -1;
for (int j = 1; j < n; ++j) // 选取V-A中的w(A,x)最大的点x加入集合
{
if (!vis[v[j]])
{
w[v[j]] += g[v[pre]][v[j]];
if (k == -1 || w[v[k]] < w[v[j]])
{
k = j;
}
}
}
vis[v[k]] = true; // 标记该点x已经加入A集合
if (i == n - 1) // 若|A|=|V|(所有点都加入了A),结束
{
int s = v[pre], t = v[k]; // 令倒数第二个加入A的点(v[pre])为s,最后一个加入A的点(v[k])为t
minCut = Min(minCut, w[t]); // 则s-t最小割为w(A,t),用其更新min_cut
for (int j = 0; j < n; ++j) // Contract(s, t)
{
g[s][v[j]] += g[v[j]][t];
g[v[j]][s] += g[v[j]][t];
}
v[k] = v[--n]; // 删除最后一个点(即删除t,也即将t合并到s)
}
// else 继续
pre = k;
}
}
return minCut;
}
int main()
{
#ifdef LOCAL
FIN;
#endif // LOCAL
int n, m;
while (~scanf("%d%d", &n, &m))
{
mem0(g);
while (m--)
{
int u = readT();
int v = readT();
int w = readT();
g[u][v] += w;
g[v][u] += w;
}
printf("%d\n", stoerWagner(n));
}
return 0;
}