red放到后面显然更优，dp【i】【j】表示前i个塔里有j个blue，最后枚举有多少个red

Stupid Tower Defense

1
2 4 3 2 1

Case #1: 12

Hint
For the first sample, the first tower is blue tower, and the second is red tower. So, the total damage is 4*(1+2)=12 damage points.
 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long int LL;

LL n,x,y,z,t;

LL dp[1600][1600];

int main()
{
    int T_T,cas=1;
    scanf("%d",&T_T);
    while(T_T--)
    {
        cin>>n>>x>>y>>z>>t;
        LL ans=0;
        memset(dp,0,sizeof(dp));
        for(LL i=2;i<=n;i++)
        {
            for(LL blue=0;blue<i;blue++)
            {
                if(blue)
                {
                    dp[i][blue]=max(dp[i-1][blue]+(t+blue*z)*(i-blue-1)*y
                                ,dp[i-1][blue-1]+(t+(blue-1)*z)*(i-blue)*y);
                }
                else
                {
                    dp[i][0]=dp[i-1][0]+t*(i-1)*y;
                }
            }
        }
        for(LL red=0;red<=n;red++)
        {
            for(LL blue=0;blue<=n-red;blue++)
            {
                LL green=n-red-blue;
                ans=max(ans,red*(x+green*y)*(blue*z+t)+dp[n-red][blue]);
            }
        }
        printf("Case #%d: %I64d\n",cas++,ans);
    }
    return 0;
}

HDOJ 4939 Stupid Tower Defense,布布扣,bubuko.com

HDOJ 4939 Stupid Tower Defense

原文：http://blog.csdn.net/ck_boss/article/details/38521753