POJ 3155Hard Life(最大密度子图)

论文出处：最小割模型在信息学竞赛终的应用

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

const double eps = 1e-;
const int inf = 0x3f3f3f3f;
const int maxn =  + ;
const int maxe =  + ;
struct edge{
    int to, next;
    double w;
} ed[maxe*];
int head[maxn], tot;
int n, m, ans;
int sp, tp, degree[maxn], d[maxn];
struct E{
    int u, v;
}p[maxe];
bool vis[maxn];
inline void init(){
    memset( head, -, sizeof(head) );
    tot = ;
}

inline void add( int u, int v, double w ){
    ed[++tot].to = v; ed[tot].w = w; ed[tot].next = head[u]; head[u] = tot;
    ed[++tot].to = u; ed[tot].w = ; ed[tot].next = head[v]; head[v] = tot;
}

inline bool bfs(){
    memset( d, , sizeof(d) );
    queue<int> q;
    d[sp] = ;
    q.push(sp);
    while( q.size() ){
        int x = q.front();
        q.pop();
        for( int i=head[x]; ~i; i=ed[i].next ){
            int y = ed[i].to;
            if( ed[i].w>=eps && !d[y] ){
                d[y] = d[x] + ;
                q.push(y);
                if( y==tp ) return ;
            }
        }
    }
    return ;
}

inline double dfs( int x, double flow ){
    if( x==tp ) return flow;
    double res = flow, k;
    for( int i=head[x]; ~i&&res>=eps; i=ed[i].next ){
        int y = ed[i].to;
        if( ed[i].w>=eps && d[y]==d[x]+ ){
            k = dfs( y, min(res, ed[i].w) );
            if( k<eps ) d[y] = ;
            ed[i].w -= k;
            ed[i^].w += k;
            res -= k;
        }
    }
    return flow-res;
}

inline double check( double g ){
    init();
    for( int i=; i<m; i++ ){
        add( p[i].u, p[i].v,  );
        add( p[i].v, p[i].u,  );
    }
    double U = m;
    for( int i=; i<=n; i++ ){
        add( sp, i, U );
        add( i, tp, U+*g-degree[i] );
    }
    double maxflow=, flow;
    while( bfs() ){
        while( (flow=dfs(sp, inf))>=eps ) maxflow += flow;
    }
    return (U*n-maxflow)*0.5;
}

inline void find_cut( int x ){
    for( int i=head[x]; ~i; i=ed[i].next ){
        int y = ed[i].to;
        if( ed[i].w>=eps && !vis[y] ){
            vis[y] = ;
            ans ++;
            find_cut(y);
        }
    }
}

int main(){
    // freopen("in.txt", "r", stdin);
    while(~scanf("%d%d", &n, &m)){
        if( !m ){
            puts("1\n1");
            continue;
        }
        memset( degree, , sizeof(degree) );
        memset( vis, , sizeof(vis) );
        sp = ; tp = n+;
        for( int i=; i<m; i++ ){
            scanf("%d%d", &p[i].u, &p[i].v);
            degree[p[i].u] ++;
            degree[p[i].v] ++;
        }
        double l = , r = m;
        double tmp = 1.0/n/n;               //这里需要设定一个上界啊，不然WA，具体证明请看论文
        while( r-l>=tmp ){
            double mid = (l+r)*0.5;
            if( check(mid)<eps ) r = mid;
            else l = mid;
        }
        check(l);                       //保证精度
        vis[sp] = ;
        find_cut(sp);
        printf("%d\n", ans);
        for( int i=; i<=n; i++ ) if(vis[i]) printf("%d\n", i);
    }

    return ;
}