http://poj.org/problem?id=3140
题意:给出n个点,每个点有一个权值,给出m条边,点和边形成一棵树,求去掉一条边,两棵树最小的查是多少
m条边,m给出的范围还比n大,迷惑人呐,形成树的话,就是n-1条边;由点权的范围知用到__int64;
abs求绝对值函数,不能用于__int64
代码:
#include<iostream>
#include<cstdio>
#define MAX 100005
#define EMAX 1000005
#define Min(a,b)a<b?a:b
using namespace std;
int val[MAX],head[MAX];
__int64 sumVal[MAX];
__int64 ans,total,Abs;
bool vs[MAX];
int n,s_edge;
struct edgEdge
{
int to,nxt;
}edge[EMAX*2];
void addedge(int u,int v)
{
s_edge++;
edge[s_edge].to=v;
edge[s_edge].nxt=head[u];
head[u]=s_edge;
s_edge++;
edge[s_edge].to=u;
edge[s_edge].nxt=head[v];
head[v]=s_edge;
}
__int64 ABS(__int64 x)
{
if(x<0)return -x;
return x;
}
void dfs(int x)
{
vs[x]=1;
sumVal[x]=val[x];
for(int e=head[x];e;e=edge[e].nxt)
{
int v=edge[e].to;
if(vs[v])continue;
dfs(v);
sumVal[x]+=sumVal[v];
}
Abs=ABS(total-2*sumVal[x]);
ans=Min(ans,Abs);
return ;
}
int main()
{
int i,j,m,CASE=0;
while(~scanf("%d%d",&n,&m))
{
total=0;//开始写while外面了,WA了N年,晕到家了
if(n==0&&m==0)break;
CASE++;
for(i=1;i<=n;i++)
{
scanf("%d",&val[i]);
vs[i]=0;
head[i]=0;
total+=val[i];
}
s_edge=0;
while(m--)
{
scanf("%d%d",&i,&j);
addedge(i,j);
}
ans=10000000000005;
dfs(1);
printf("Case %d: %I64d\n",CASE,ans);
}
return 0;
}