呵呵，还有很多地方可以优化
#include<stdio.h>
#include<math.h>
int used[45000],loc[45000][10];
main()
{
	int a[100],n,i,j,k,l,tloc;
	long sum,half,cha,min,minrec,small;
	scanf("%d",&n);
	sum=0;
        for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		sum+=a[i];
	}
	half=sum/2;
	min=sum;
	minrec=sum;
	used[sum]=1;
	for(i=0;i<n;i++)
	{
		if(!(half-minrec))break;
		for(j=min;j<=sum;j++)
		{
			if(used[j])
			for(l=0;l<used[j];l++)
			{
				cha=j-a[i];
				if(cha<min&&cha>=0)min=cha;
				if(cha<=sum&&cha>=0)
				tloc=loc[j][l]+1;
				if((tloc==n/2||tloc==n/2+n%2)&&abs(half-cha)<abs(half-minrec))minrec=cha;
				if(used[cha])
                  		{
					for(k=0;k<used[cha];k++)
						if(tloc==loc[cha][k])break;
					if(k>=used[cha])
					{
						 loc[cha][used[cha]]=tloc;
						 used[cha]++;
					}
				}

				else
				{
					loc[cha][used[cha]]=tloc;
					used[cha]++;
				}
                        }
		}
	}
	if(minrec<=half)small=minrec;
	else small=sum-minrec;
	printf("%ld %ld",small,sum-small);
	return 0;
}

• 我喜欢DP 我自己写的dp mle,来研究一下yiyiyi4321大牛的 (0) HatTricker 2006-08-23 17:11:12
• Re:我不知道这样算不算DP，不过比那些代码要正确 (21) xia192041 2006-12-07 10:10:17
  • ZOJ是多case的吧! (25) yiyiyi4321 2006-12-07 10:22:59
    • Re:ZOJ是多case的吧! (31) xia192041 2006-12-07 18:16:51
    • Re:ZOJ是多case的吧! (21) xia192041 2006-12-07 18:24:22