题目大意:给出n个点,m条边,问把哪条边去掉,使得图分成两个部分,且两部分点数差最小;
思路分析:求割边;
代码实现:
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>
#include<iostream>
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define MEM(a) (memset((a),0,sizeof(a)))
#define MEME(a) (memset((a),-1,sizeof(a)))
#define MEMX(a) (memset((a),0x3f,sizeof(a)))
using namespace std;
const int N=10005;
const int M=20005;
const int INF=0x3f3f3f3f;
int n,m,first[N],nex[M*2],low[N],dfn[N],num[N],s_num[N],tim,bccn,sum,res,top;
struct Edge{
int u,v;
Edge(int _u=0,int _v=0):u(_u),v(_v){}
}edge[M*2];
void Addedge(int u,int v){
edge[top]=Edge(u,v);
nex[top]=first[u];
first[u]=top++;
}
stack<int> st;
void Tarjan_bcc(int u,int fa){
dfn[u]=low[u]=++tim;
st.push(u);
int v,flag=1;
for(int i=first[u];i+1;i=nex[i]){
v=edge[i].v;
if(v==fa&&flag){
flag=0;
continue;
}
if(!dfn[v]){
Tarjan_bcc(v,u);
low[u]=Min(low[v],low[u]);
if(dfn[u]<low[v]){
++bccn;
int tmp=0,x;
do{
x=st.top();
st.pop();
tmp+=num[x];
}while(x!=v);
res=Min(res,abs(sum-tmp*2));
num[u]+=tmp;
}
}else low[u]=Min(low[u],dfn[v]);
}
}
int main(){
int r1,r2;
while(~scanf("%d%d",&n,&m)){
MEM(dfn),MEM(low),MEM(s_num),MEME(first);
bccn=sum=tim=top=0;
res=INF;
while(!st.empty()) st.pop();
for(int i=0;i<n;++i) scanf("%d",&num[i]),sum+=num[i];
while(m--){
scanf("%d%d",&r1,&r2);
Addedge(r1,r2);
Addedge(r2,r1);
}
for(int i=0;i<n;++i) if(!dfn[i]) Tarjan_bcc(i,-1);
if(bccn==0){
printf("impossible\n");
continue;
}
printf("%d\n",res);
}
}