Battle Ships(复习泛化物品**)
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 ti seconds to produce the i-th battle ship and this battle ship can make the tower loss li 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 li(1 ≤
li ≤ 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
1 1
1 1
2 10
1 1
2 5
3 100
1 10
3 20
10 100
Sample Output
2
4
5
Author: FU, Yujun
Contest: ZOJ Monthly, July
2012
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int f[],protim[],fi[];
int n,l,i,j;
int main()
{
while(scanf("%d%d",&n,&l)!=EOF)
{
memset(f,,sizeof(f));
for(i=;i<=n;i++)
scanf("%d%d",&protim[i],&fi[i]);
for(i=;i<=l;i++)
for(j=;j<=n;j++)
f[i+protim[j]]=max(f[i+protim[j]],f[i]+i*fi[j]);
for( i=;i<=;i++)
if(f[i]>=l)break;
printf("%d\n",i);
}
return ;
}
最新文章
- mysql语句查询练习
- 探讨Js的事件的冒泡阶段
- yaf学习资料
- java 给指定时间加上天数or给当前日期加天数
- 【VerySky原创】 ME9F
- robotframework笔记18
- 学习JSONP
- C/C++笔试题目
- Ultimus BPM 房地产与建筑行业应用解决方案
- eclipse配置运行时变量
- Centos7系统详细的启动流程
- oracle数据库tns配置方法详解
- HDU2732一个让我debug了一晚上的题目
- PyQt5--QPixmap
- 构造代码块----java基础总结
- android View未渲染时获得高度
- AngularJS------Error: Cannot find module &#39;@angular-devkit/core&#39;
- 《F4+2团队项目需求改进与系统设计》
- 20155336 2016-2017-2 《Java程序设计》第四周学习总结
- 用js实现千位分隔符