ahu-518-塔

水DP，排个序就不超时了

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int dp[2][510000],a[60],n;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
       int sum = 0,ans = -2; 
       memset(dp,-1,sizeof(dp));
       int pre = 0;
       for(int i=0;i<n;i++)
         scanf("%d",&a[i]);
       sort(a,a+n);
       dp[pre][0] = 0;
       for(int i=0;i<n;i++)
        {
            sum+=a[i];
            pre = 1-pre;
          for(int j=0;j<=sum;j++)
          {
            dp[pre][j] = dp[1-pre][j];
            if(dp[1-pre][abs(j-a[i])]!=-1)dp[pre][j] = max(dp[pre][j],dp[1-pre][abs(j-a[i])]+a[i]);
            if(j+a[i]<=sum&&dp[1-pre][j+a[i]]!=-1)dp[pre][j] = max(dp[pre][j],dp[1-pre][j+a[i]]+a[i]);
          }
        }
       if(dp[pre][0])ans = dp[pre][0];
       printf("%d\n",ans/2);
    }
    return 0;
}