ZOJ3623: Battle Ships(类完全背包)
来源:互联网 发布:金融数据挖掘python 编辑:程序博客网 时间:2024/06/05 08:58
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 11 12 101 12 53 1001 103 2010 100
Sample Output
245
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 0x3f3f3f3fint 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;}
- ZOJ3623: Battle Ships(类完全背包)
- ZOJ3623 Battle Ships (完全背包)
- ZOJ3623:Battle Ships(完全背包)
- Battle Ships(完全背包)
- 完全背包 battle ships
- zoj3623 Battle Ships DP
- ZOJ3623 Battle Ships
- zoj3623 Battle Ships
- 【zoj3623】【Battle Ships】
- ZOJ3623 Battle Ships
- ZOJ 3623 Battle Ships (完全背包)
- ZOJ 3623 Battle Ships(完全背包)
- ZOJ 3623 - Battle Ships(完全背包)
- ZOJ 3623 Battle Ships(完全背包)
- ZOJ-3623 Battle Ships (完全背包 应用题)
- TOJ 4365 ZOJ 3623 Battle Ships / 完全背包
- ZOJ - 3623 Battle Ships(完全背包或者BFS)
- zoj3623-完全背包(向前插入)
- Android-EditText只能输入不能删除的问题
- POJ 2362 Square
- 后缀数组(重复次数最多的连续重复子串)
- php读取csv文件,在linux上出现中文读取不到的情况 解决方法
- Cube Sphere (国外技术文章收藏)
- ZOJ3623: Battle Ships(类完全背包)
- Pycharm 2016.3 注册码
- Oracle 数据库导入导出(imp/exp)
- 求各个位数的值相加起来的总和是多少
- 是时候搭建起自己的云盘服务了
- swift 本地归档、解档储存
- CMake 手册详解(八)
- Problem--4A--Codeforces--Watermelon
- jquery用法--css操作