HDU 2242

有重边的边双连通版本。

#include<cstdio>
#include<string.h>
#include<math.h>
#include<stack>
#include<algorithm>
//#include<memory.h>
//#pragma comment(linker, "/STACK:1024000000,1024000000")//预处理栈，避免栈溢出
#define N 10010
#define M 20010
using namespace std;
struct edge{
	int u,v,next;
}edge[M*4];
int n,m,num[N],sum[N],allsum;
int cnt,head[N],head2[N];
int scc,depth,dfn[N],low[N],belong[N];
stack<int>sta;
int dps[N];
int ans;
void addedge(int u,int v){
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].next=head[u];
    head[u]=cnt++;
    edge[cnt].u=v;
    edge[cnt].v=u;
    edge[cnt].next=head[v];
    head[v]=cnt++;
}
void addedge2(int u,int v){
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].next=head2[u];
    head2[u]=cnt++;
}
void tarjan(int u,int father){
    int flag=1;
    dfn[u]=low[u]=++depth;
    sta.push(u);
    for(int j=head[u];j!=-1;j=edge[j].next){
        int v=edge[j].v;
        if(v==father && flag){          //加上这句话能判断重边，把之前因为father到u的边而建立的反向边排除
            flag=0;
            continue;
        }
        if(dfn[v]==0){
            tarjan(v,u);
            low[u]=min(low[v],low[u]);
        }
        else
            low[u]=min(low[u],dfn[v]);
    }
    if(dfn[u]==low[u]){
        scc++;
        while(1){
            int tem=sta.top();
            sta.pop();
            belong[tem]=scc;
            sum[scc]+=num[tem];
            if(tem==u)break;
        }
    }
}
void init(){
    scc=cnt=depth=allsum=0;
    memset(head,-1,sizeof(head));
    memset(head2,-1,sizeof(head2));
    memset(dfn,0,sizeof(dfn));
    memset(sum,0,sizeof(sum));
    memset(dps,0,sizeof(dps));
    ans=100000000;
}
void dp(int u,int father){
    int i;
    dps[u]=sum[u];
    for(i=head2[u];i!=-1;i=edge[i].next){
        int v=edge[i].v;
        if(v==father)continue;
        dp(v,u);
        dps[u]+=dps[v];
        if(abs(allsum-2*dps[v])<ans)
            ans=abs(allsum-2*dps[v]);
    }
}
int main(){
	int i,j,u,v,q;
	while(scanf("%d %d",&n,&m)==2){
        init();
        for(i=1;i<=n;i++){
            scanf("%d",&num[i]);
            allsum+=num[i];
        }
        for(i=1;i<=m;i++){
            scanf("%d %d",&u,&v);
            u++,v++;
            addedge(u,v);
        }
        for(i=1;i<=n;i++)
            if(!dfn[i])
                tarjan(i,0);
        if(scc==1){
            printf("impossible\n");
            continue;
        }
        for(i=1;i<=n;i++)
            for(j=head[i];j!=-1;j=edge[j].next)
                if(belong[edge[j].u] != belong[edge[j].v])
                    addedge2(belong[edge[j].u],belong[edge[j].v]);
        dp(1,0);
        printf("%d\n",ans);
	}
}