HDU3435 A new Graph Game 最小费用流

http://acm.hdu.edu.cn/showproblem.php?pid=3435

题意：。。。

代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#define nMAX  10005
#define mMAX  99999
#define inf 99999999
using namespace std;
struct Edge
{
    int u,v,cap,cost,nxt;
}edge[mMAX];
int head[nMAX],dis[nMAX],qu[nMAX],pre[nMAX];
int s_edge,ans,maxf;
bool vs[nMAX];
void addedge(int u,int v,int ca,int co)
{
    edge[++s_edge].v=v;
    edge[s_edge].cap=ca;
    edge[s_edge].cost=co;
    edge[s_edge].nxt=head[u];
    head[u]=s_edge;

    edge[++s_edge].v=u;
    edge[s_edge].cap=0;
    edge[s_edge].cost=-co;
    edge[s_edge].nxt=head[v];
    head[v]=s_edge;
}

bool spfa(int s,int t,int n)//始点 终点 点数
{
    for(int i=0;i<=n;i++)
    {
        dis[i]=inf;
        vs[i]=0;
    }
    int start=0,tail=1;
    qu[0]=s;
    dis[s]=0;
    vs[s]=1;
    while(start!=tail)
    {
        int u=qu[start];
        for(int e=head[u];e;e=edge[e].nxt)
        {
            int v=edge[e].v;
            if(edge[e].cap&&dis[v]>dis[u]+edge[e].cost)
            {
                dis[v]=dis[u]+edge[e].cost;
                pre[v]=e;
                if(!vs[v])
                {
                    vs[v]=1;
                    qu[tail++]=v;
                    if(tail==nMAX)tail=0;
                }
            }
        }
        vs[u]=0;
        start++;
        if(start==nMAX)start=0;
    }
    if(dis[t]==inf)return 0;
    return 1;
}
void end(int s,int t)
{
    int u,p;
    for(u=t;u!=s;u=edge[p^1].v)
    {
        p=pre[u];
        edge[p].cap-=1;
        edge[p^1].cap+=1;
        ans+=edge[p].cost;

    }
    maxf+=1;
}

int main()
{
    int  s,t,i,j,k,CASE,ca,n,m;
    scanf("%d",&CASE);
    for(ca=1;ca<=CASE;ca++)
    {
        scanf("%d%d",&n,&m);
        s=0;
        t=2*n+1;
        memset(head,0,sizeof(head));
        s_edge=1;
        for(i=1;i<=n;i++)
        {
            addedge(s,i,1,0);
            addedge(i+n,t,1,0);
        }
        while(m--)
        {
            scanf("%d%d%d",&i,&j,&k);
            addedge(i,j+n,1,k);
            addedge(j,i+n,1,k);
        }
        ans=0,maxf=0;
        while(spfa(s,t,2*n+2))
        {
            end(s,t);
        }
        if(maxf==n)printf("Case %d: %d\n",ca,ans);
        else printf("Case %d: NO\n",ca);
    }
    return 0;
}

　　

转载于:https://www.cnblogs.com/sdau10kuaile/archive/2012/04/06/2435092.html