ZOJ2532-网络流求关键边

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

const int NN=110;
const int MM=3000;
const int INF=0x3fffffff;

int n,m,S,T,NV;

struct Edge{
    int u,v,flow,next;
    Edge() {}
    Edge(int _u,int _v,int _flow,int _next)
    {
        u=_u; v=_v; flow=_flow; next=_next;
    }
}e[MM],etmp[MM];
int en,head[NN];
inline void add(int u,int v,int flow)
{
    e[en]=Edge(u,v,flow,head[u]);
    head[u]=en++;
    e[en]=Edge(v,u,0,head[v]);
    head[v]=en++;
}

int dis[NN],pre[NN],gap[NN],cur[NN];
int sap()
{
    int maxflow=0;
    for (int i=0; i<NV; i++)
    {
        dis[i]=gap[i]=0;
        cur[i]=head[i];
    }
    int aug=INF;
    int u=pre[S]=S;
    gap[0]=NV;
    while (dis[S]<NV)
    {
        loop:
        for (int &i=cur[u]; i!=-1; i=e[i].next)
        {
            int v=e[i].v;
            if (e[i].flow && dis[u]==dis[v]+1)
            {
                if (e[i].flow<aug) aug=e[i].flow;
                pre[v]=u;
                u=v;
                if (v==T)
                {
                    maxflow+=aug;
                    for (u=pre[u]; v!=S; v=u,u=pre[u])
                    {
                        e[cur[u]].flow-=aug;
                        e[cur[u]^1].flow+=aug;
                    }
                    aug=INF;
                }
                goto loop;
            }
        }
        int min_dis=NV;
        for (int i=head[u]; i!=-1; i=e[i].next)
        {
            int v=e[i].v;
            if (e[i].flow && dis[v]<min_dis)
            {
                min_dis=dis[v];
                cur[u]=i;
            }
        }
        if (--gap[dis[u]]==0) break;
        gap[dis[u]=min_dis+1]++;
        u=pre[u];
    }
    return maxflow;
}

bool f1[NN],f2[NN];
void dfs1(int u)
{
    f1[u]=1;
    for (int i=head[u]; i!=-1; i=e[i].next)
    {
        int v=e[i].v;
        if (!f1[v] && e[i].flow) dfs1(v);
    }
}
void dfs2(int u)
{
    f2[u]=1;
    for (int i=head[u]; i!=-1; i=e[i].next)
    {
        int v=e[i].v;
        if (!f2[v] && e[i^1].flow) dfs2(v);
    }
}

void init()
{
    S=n+m+1; NV=S+1; T=0;
    en=0;
    memset(head,-1,sizeof(head));

    memset(f1,0,sizeof(f1));
    memset(f2,0,sizeof(f2));
}

int p[1002];
int main()
{
    int w,x,y,z;
    while (scanf("%d%d%d",&n,&m,&w),n|m|w)
    {
        init();
        for (int i=1; i<=n; i++) add(S,i,INF);
        for (int i=1; i<=w; i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            p[i]=en;
            add(x,y,z);
        }
        sap();
        dfs1(S);
        dfs2(T);
        bool flag=false;
        for (int i=1; i<=w; i++)
        {
            if (f1[e[p[i]].u] && f2[e[p[i]].v] && !e[p[i]].flow)
            {
                if (!flag) flag=true;
                else       printf(" ");
                printf("%d",i);
            }
        }
        printf("\n");
    }
    return 0;
}//之前写了一个穷举版的也过了~