> #include <stdio.h>
> #include <vector>
> 
> using namespace std;
> 
> const long MAX_N=100001;
> const long long inf=1000001LL;
> 
> bool arr[MAX_N];
> vector<long> conn[MAX_N];
> long long zz[MAX_N];
> long n;
> long long nowMin,sum;
> 
> long long search(long w)
> {
> 	long long tot=zz[w];
> 	long long maxBlock=inf;
> 	arr[w]=true;
> 	for (vector<long>::iterator i=conn[w].begin();i!=conn[w].end();i++)
> 		if (!arr[*i])
> 		{
> 			long long tmp=search(*i);
> 			if (tmp>=sum-tmp)
> 			{
> 				if (maxBlock>2*tmp-sum) maxBlock=2*tmp-sum;
> 			}
> 			else
> 			{
> 				if (maxBlock>sum-2*tmp) maxBlock=sum-2*tmp;
> 			}
> 			tot+=tmp;
> 		}
> 	if (tot>=sum-tot)
> 	{
> 		if (maxBlock>2*tot-sum) maxBlock=2*tot-sum;
> 	}
> 	else
> 	{
> 		if (maxBlock>sum-2*tot) maxBlock=sum-2*tot;
> 	}
> 	if (maxBlock<nowMin) nowMin=maxBlock;
> 	return tot;
> }
> 
> int main()
> {
> 	long i,m,a,b,pp;
> 	pp=1;
> 	scanf("%ld%ld",&n,&m);
> 	while (!(n==0&&m==0))
> 	{
> 		for (i=1;i<=n;i++)
> 			conn[i].clear();
> 		sum=0;
> 		for (i=1;i<=n;i++)
> 		{
> 			scanf("%I64d",&zz[i]);
> 			sum=sum+zz[i];
> 		}
> 	    for (i=1;i<=m;i++)
> 		{
> 			scanf("%ld%ld",&a,&b);
> 		    conn[a].push_back(b);
> 		    conn[b].push_back(a);
> 		}
> 		memset(arr,false,sizeof(arr));
> 	    nowMin=inf;
> 	    search(1);
> 	    printf("Case %ld: %I64d\n",pp,nowMin);
> 		pp++;
>         scanf("%ld%ld",&n,&m);
> 	}
> 	return 0;
> } 

• 我也是wa到不行，谁给组数据？ (0) 1083_3 2006-12-09 21:43:19
• inf是不是小了点? (0) ArXoR 2006-12-09 21:46:07
  • 小吗?有人教我在数字后面加个LL数字就变得很大了啊,我又重新写了一个,这次没用inf,还是WA!(代码见内) (1014) lxhgww 2006-12-09 22:40:19
    • LL表示该数为long long类型，值该是多少就是多少 (1138) wywcgs 2006-12-09 22:42:06