ZOJ3623: Battle Ships(类完全背包)
2017-01-17 16:49
375 查看
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.
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.
Author: FU, Yujun
Contest: ZOJ Monthly, July 2012
dp[i]表示i时间内能制造的最大伤害,dp[i] = max( dp[i], dp[i-time[j]] + (i-time[j])*value[j] ),可以理解为dp[i-time[j]]的事件保持不变,而在事件前面增加time[j]的时间制造第j种船,该船在接下来i-time[j]时间内造成额外的伤害(i-time[j])*value[j]。
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
dp[i]表示i时间内能制造的最大伤害,dp[i] = max( dp[i], dp[i-time[j]] + (i-time[j])*value[j] ),可以理解为dp[i-time[j]]的事件保持不变,而在事件前面增加time[j]的时间制造第j种船,该船在接下来i-time[j]时间内造成额外的伤害(i-time[j])*value[j]。
# include <stdio.h> # include <string.h> # define INF 0x3f3f3f3f int dp[333], v[31],c[31]; int main() { int n, t, i, j; while(~scanf("%d%d",&n,&t)) { memset(dp, 0, sizeof(dp)); int cnt = INF; for(i=0; i<n; ++i) scanf("%d%d",&c[i],&v[i]); for(i=0; i<n; ++i) { for(j=c[i]; j; ++j) { if(dp[j-c[i]]+v[i]*(j-c[i]) > dp[j]) dp[j] = dp[j-c[i]]+v[i]*(j-c[i]); if(dp[j] >= t) break; } if(j < cnt) cnt = j; } printf("%d\n",cnt); } return 0; }
相关文章推荐
- ZOJ3158 【DFS】
- 算法学习-2
- 《Android源码设计模式与实战》单一原则学习笔记一
- socketpair
- 安卓APP市场下架再上架 遇到的一些问题
- JavaEE-Tomcat配置
- Java抽象类与接口
- MySQL Packet for query is too large 问题及解决方案
- 如何用消息系统避免分布式事务?
- C++缓冲区溢出
- linux:C++实现ping
- CMake手册详解 (十五)
- easyui控件操作集锦
- Android简易的音乐播放器实现
- POJ-1442 Black Box,treap名次树!
- selenium + python自动化测试环境搭建
- android使用 ScrollerView 实现 可上下滚动的分类栏实例
- 【Ant】PDE/Build
- 笔记 基础标签
- 西北工业大学锐捷linux系统登陆方式