[小割]hunnu 10063 bomb the road#无向图最小割

/**
[小割]hunnu 10063 bomb the road#无向图最小割

*/
#include <stdio.h>
#include <string.h>

#define N 55
#define maxw 100000
int g[N][N],w[N],a[N],v[N],na[N];
int mincut(int n)
{
    int i,j,pv,zj;
    int best = maxw * n * n;
    for(i = 0; i < n; ++i)
        v[i] = i;
    while(n > 1)
    {
        for(a[v[0]] = 1,i = 1; i < n; ++i)
        {
            a[v[i]] = 0;
            na[i -1] = i;
            w[i] = g[v[0]][v[i]];
        }
        for(pv = v[0],i = 1; i < n; ++i)
        {
            for(zj = -1,j = 1; j < n; ++j)
                if(!a[v[j]] &&(zj < 0 || w[j] > w[zj]))
                    zj = j;
                a[v[zj]] &#