HDU 4939 Stupid Tower Defense

原创 2015年11月20日 23:18:02
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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU - 4939 Stupid Tower Defense

Problem Description FSF is addicted to a stupid tower defense game. The goal of tower defense games ...
  • u011345136
  • u011345136
  • 2014年08月13日 10:40
  • 460

hdu 4939 Stupid Tower Defense

hdu 4939 Stupid Tower Defense 题意呢 就是关
  • u011699990
  • u011699990
  • 2014年08月13日 19:10
  • 1331

HDU 4939 Stupid Tower Defense

Stupid Tower Defense Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java...
  • u011403366
  • u011403366
  • 2014年08月13日 12:53
  • 376

HDU 4939 Stupid Tower Defense

题目链接~~> 做题感悟:
  • u011074149
  • u011074149
  • 2014年08月16日 10:58
  • 550

HDOJ 4939 Stupid Tower Defense

red放到后面显然更优,dp【i】【j】表示前i个塔里有j个blue,最后枚举有多少个red Stupid Tower Defense Time Limit: 12000/6000 MS ...
  • u012797220
  • u012797220
  • 2014年08月12日 21:52
  • 690

dp --- hdu 4939 : Stupid Tower Defense

Stupid Tower Defense Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java...
  • u013371163
  • u013371163
  • 2017年03月05日 17:10
  • 86

hdu 4939 Stupid Tower Defense dp

Stupid Tower Defense Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/...
  • yskyskyer123
  • yskyskyer123
  • 2015年11月18日 08:18
  • 307

HDU 4939 Stupid Tower Defense(DP)

题意略。 sil
  • u012962816
  • u012962816
  • 2014年08月12日 21:23
  • 487

HDU 4939 Stupid Tower Defense (DP)

#pragma comment(linker, "/STACK:102400000,102400000") #include #include #include using namespace ...
  • u012149208
  • u012149208
  • 2014年08月12日 23:57
  • 86

HDU 4939 Stupid Tower Defense(贪心+dp)

HDU Stupid Tower Defense 题目链接 题意:有一些塔,红塔能攻击经过他的,绿塔能攻击经过之后的,蓝塔能把经过之后的减速,求在1-n上放塔,求伤害最大值 思路:一...
  • u011217342
  • u011217342
  • 2014年08月12日 23:33
  • 861
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4939 Stupid Tower Defense
举报原因:
原因补充:

(最多只允许输入30个字)