hdu3435(费用流)

链接：点击打开链接

题意：删除无向图中的边使得哈密顿回路的边权和最小

代码：

#include <math.h>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
struct node{
    int to,cap,cost,rev;
};
int V;
int dis[10005],prevv[10005],preve[10005];
vector<node> G[10005];
void addedge(int from,int to,int cap,int cost){
    G[from].push_back((node){to,cap,cost,G[to].size()});
    G[to].push_back((node){from,0,-cost,G[from].size()-1});
}
int min_cost_flow(int s,int t,int f){
    int i,d,v,ans,sign;
    ans=0;
    while(f>0){
        fill(dis,dis+V,INF);
        dis[s]=0;
        sign=1;
        while(sign){
        sign=0;
        for(v=0;v<V;v++){
            if(dis[v]==INF)
            continue;
            for(i=0;i<G[v].size();i++){
                node &e=G[v][i];
                if(e.cap>0&&dis[e.to]>dis[v]+e.cost){
                    dis[e.to]=dis[v]+e.cost;
                    prevv[e.to]=v;
                    preve[e.to]=i;
                    sign=1;
                }
            }
        }
        }
        if(dis[t]==INF)
        return -1;
        d=f;
        for(v=t;v!=s;v=prevv[v])
        d=min(d,G[prevv[v]][preve[v]].cap);
        f-=d;
        ans+=d*dis[t];
        for(v=t;v!=s;v=prevv[v]){
            node &e=G[prevv[v]][preve[v]];
            e.cap-=d;
            G[v][e.rev].cap+=d;
        }
    }
    return ans;
}
int main(){
    int i,t,n,m,u,v,w,ans,cas;
    scanf("%d",&t);                             //因为删完边后图时哈密顿图，也就是说
    for(cas=1;cas<=t;cas++){                    //每个顶点的入度和出度相等并都为1，因此
        scanf("%d%d",&n,&m);                    //将每个点拆点连成流量是1，费用是边权的边
        V=2*n+2;                                //跑流量是n的费用流即可
        for(i=0;i<=2*n+2;i++)
        G[i].clear();
        for(i=0;i<m;i++){
        scanf("%d%d%d",&u,&v,&w);
        addedge(u,v+n,1,w);
        addedge(v,u+n,1,w);
        }
        for(i=1;i<=n;i++){
            addedge(0,i,1,0);
            addedge(i+n,2*n+1,1,0);
        }
        ans=min_cost_flow(0,2*n+1,n);
        if(ans==-1)
        printf("Case %d: NO\n",cas);
        else
        printf("Case %d: %d\n",cas,ans);
    }
    return 0;
}