Stupid Tower Defense
Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 381 Accepted Submission(s): 91
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.
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)
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: 12HintFor 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
红塔一定放在最后为最优解
枚举最后红塔的数量,前面蓝塔的数量i,绿塔的数量j,
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
#define PB push_back
#define MP make_pair
#define CLR(vis) memset(vis,0,sizeof(vis))
#define MST(vis,pos) memset(vis,pos,sizeof(vis))
#define MAX3(a,b,c) max(a,max(b,c))
#define MAX4(a,b,c,d) max(max(a,b),max(c,d))
#define MIN3(a,b,c) min(a,min(b,c))
#define MIN4(a,b,c,d) min(min(a,b),min(c,d))
#define PI acos(-1.0)
#define INF 0x7FFFFFFF
#define LINF 1000000000000000000LL
#define eps 1e-8
typedef long long ll;
typedef unsigned long long ull;
typedef double PointType;
struct point{
PointType x,y;
point(double x=0,double y=0):x(x),y(y) {}
};
typedef point Vector ;
Vector operator + (Vector A , Vector B){
return Vector(A.x + B.x , A.y + B.y);
}
Vector operator - (point A , point B){
return Vector(A.x - B.x , A.y - B.y);
}
Vector operator * (Vector A , double p){
return Vector(A.x * p, A.y * p);
}
Vector operator / (Vector A , double p){
return Vector(A.x / p, A.y / p);
}
bool operator < (const point& a, const point& b){
return a.x<b.x||(a.x==b.x && a.y<b.y);
}
int dcmp(double x){
if(fabs(x) < eps) return 0;else return x<0 ?-1:1;
}
double Dot(Vector A , Vector B){
return A.x*B.x+A.y*B.y;
}
double Length(Vector A){
return sqrt(Dot(A,A));
}
double Cross(Vector A , Vector B){
return A.x*B.y - A.y*B.x;
}
ll n,x,y,z,t;
ll dp[1600][1600];
int main()
{
int T;
cin>>T;
ll cas=1;
ll ans;
while(T--)
{
scanf("%I64d%I64d%I64d%I64d%I64d",&n,&x,&y,&z,&t);
CLR(dp);
ans=n*t*x;
for(ll i=0;i+1<=n;i++) //blue
{
for(ll j=0;j+i+1<=n;j++) //green
{
ll k=n-i-j; //red
ll v=i*z+t;
ll temp=dp[i][j]+k*v*x+k*v*y*j;
ans=max(ans,temp);
ll res=v*y*j;
dp[i+1][j]=max(dp[i+1][j],dp[i][j]+res);
dp[i][j+1]=max(dp[i][j+1],dp[i][j]+res);
}
}
printf("Case #%I64d: %I64d\n",cas++,ans);
}
return 0;
}