关闭

[置顶] HDU 4939 Stupid Tower Defense

标签: ACM算法
135人阅读 评论(0) 收藏 举报
分类:
Problem Description
FSF is addicted to a stupid tower defense game. The goal of tower defense games is to try to stop enemies from crossing a map by building traps to slow them down and towers which shoot at them as they pass.

The map is a line, which has n unit length. We can build only one tower on each unit length. The enemy takes t seconds on each unit length. And there are 3 kinds of tower in this game: The red tower, the green tower and the blue tower. 

The red tower damage on the enemy x points per second when he passes through the tower.

The green tower damage on the enemy y points per second after he passes through the tower.

The blue tower let the enemy go slower than before (that is, the enemy takes more z second to pass an unit length, also, after he passes through the tower.)

Of course, if you are already pass through m green towers, you should have got m*y damage per second. The same, if you are already pass through k blue towers, the enemy should have took t + k*z seconds every unit length.

FSF now wants to know the maximum damage the enemy can get.
 

Input
There are multiply test cases.

The first line contains an integer T (T<=100), indicates the number of cases. 

Each test only contain 5 integers n, x, y, z, t (2<=n<=1500,0<=x, y, z<=60000,1<=t<=3)
 

Output
For each case, you should output "Case #C: " first, where C indicates the case number and counts from 1. Then output the answer. For each test only one line which have one integer, the answer to this question.
 

Sample Input
1 2 4 3 2 1
 

Sample Output
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.
 

Author
UESTC
 

Source
 

Recommend
We have carefully selected several similar problems for you:  5566 5565 5564 5561 5560 
 



dp。


#include <iostream>
using namespace std;
#include <algorithm>
#include <stdio.h>
#include <cstring>
typedef long long ll;
ll dp[1550][1550];
int main()
{
    int t;
    scanf("%d",&t);
    int icase=1;
    while(t--)
    {
        ll n,x,y,z,t;
        cin>>n>>x>>y>>z>>t;
        memset(dp,0,sizeof(dp));
        printf("Case #%d: ",icase++);
        ll ans=n*x*t;
        int i,j;
        for(i=1; i<=n; i++)   //前i个点
            for(j=0; j<=i; j++)  //蓝塔数量
            {
                if(j==0)
                    dp[i][j]=dp[i-1][j]+(i-j-1)*t*y;   //不放
                else
                    dp[i][j]=max(dp[i-1][j-1]+(i-j)*y*(t+(j-1)*z),dp[i-1][j]+(i-j-1)*(t+j*z)*y);//放和不放取max
                ans=max(ans,dp[i][j]+(n-i)*x*(t+j*z)+(n-i)*y*(i-j)*(t+j*z));
            }
        cout<<ans<<endl;
    }
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:142903次
    • 积分:4891
    • 等级:
    • 排名:第5798名
    • 原创:359篇
    • 转载:1篇
    • 译文:0篇
    • 评论:17条
    最新评论