ZOJ 3623 Battle Ships

最新推荐文章于 2019-04-15 16:29:11 发布

Liao_Jingyi

最新推荐文章于 2019-04-15 16:29:11 发布

阅读量344

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/Liao_Jingyi/article/details/44087099

版权

动态规划专栏收录该内容

39 篇文章 0 订阅

订阅专栏

Description

Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L longevity. The player has a military factory, which can produce N kinds of battle ships. The factory takes t_i seconds to produce the i-th battle ship and this battle ship can make the tower loss l_i longevity every second when it has been produced. If the longevity of the tower lower than or equal to 0, the player wins. Notice that at each time, the factory can choose only one kind of battle ships to produce or do nothing. And producing more than one battle ships of the same kind is acceptable.

Your job is to find out the minimum time the player should spend to win the game.

Input

There are multiple test cases.
The first line of each case contains two integers N(1 ≤ N ≤ 30) and L(1 ≤ L ≤ 330), N is the number of the kinds of Battle Ships, L is the longevity of the Defense Tower. Then the following N lines, each line contains two integers t _i(1 ≤ t _i ≤ 20) and l_i(1 ≤ l_i ≤ 330) indicating the produce time and the lethality of the i-th kind Battle Ships.

Output

Output one line for each test case. An integer indicating the minimum time the player should spend to win the game.

Sample Input

Sample Output

2
4
5

解析

动态规划。不过这个题的思考方式比较特殊……

dp[i]表示时间i能造成的最大伤害。
那里的dp转移方程看起来很奇怪，其实它是从0开始造i船，其他的造船计划全部向后推迟T[i]

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T[34],l[34],N,L,dp[334];
int main()
{
	int i,j;
	while(scanf("%d%d",&N,&L)==2)
	{
		for(i=1;i<=N;i++)
			scanf("%d%d",&T[i],&l[i]);
		memset(dp,0,sizeof(dp));
		for(j=1;j<=L;j++)
			for(i=1;i<=N;i++)
				dp[j+T[i]]=max(dp[j]+l[i]*j,dp[j+T[i]]);
		for(i=1;i<=330;i++)
			if(dp[i]>=L) break;
		printf("%d\n",i);
	}
	return 0;
}