hdu 4939 Stupid Tower Defense ( dp )

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <algorithm>
 6 #define LL __int64
 7 const int maxn = 1500+10;
 8 using namespace std;
 9 LL d[maxn][maxn];
10 
11 int main()
12 {
13     int T, ca=1;
14     LL n, x, y, z, t, i, j;
15     LL ans, ret;
16     scanf("%d", &T);
17     while(T--)
18     {
19         scanf("%I64d%I64d%I64d%I64d%I64d", &n, &x, &y, &z, &t);
20         ret = 0;
21         memset(d, 0, sizeof(d));
22         ret = n*x*t; //刚开始少了全部都是红塔的情况，错了好多次，因为我下面写的是n-i;
23         for(i = 1; i <= n; i++)
24         {
25             for(j = 0; j <= i; j++)
26             {
27                 LL tmp = 0;
28                 if(j!=i)
29                 d[i][j] = d[i-1][j]+y*j*(t+z*(i-j-1)); //第i个放蓝塔
30                 if(j!=0)
31                 tmp = d[i-1][j-1]+y*(j-1)*(t+z*(i-j)); //第i个放绿塔
32 
33                 d[i][j] = max(tmp, d[i][j]);
34                 ans = d[i][j]+(x+y*j)*(t+z*(i-j))*(n-i); //加上后面的伤害
35                 if(ans > ret)
36                 ret = ans;
37             }
38         }
39         printf("Case #%d: %I64d\n", ca++, ret);
40     }
41     return 0;
42 }