zoj3623(更新顺序影响下的完全背包)
来源:互联网 发布:kmp算法程序 编辑:程序博客网 时间:2024/05/16 08:45
地址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3623
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 produceN 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
思路:以时间为容量,伤害的总血量为价值。因为塔可以在建造好后每一秒都造成伤害,所以建造同种塔的情况下,先后顺序会影响最终结果。
代码:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int dp[700],vol[40],val[40];int main(){ int n,v,i,j,ans; while(scanf("%d%d",&n,&v)>0) { memset(dp,0,sizeof(dp)); for(i=0; i<n; i++) scanf("%d%d",&vol[i],&val[i]); ans=1100; for(i=0; i<n; i++) { for(j=vol[i]; ; j++) { if(dp[j-vol[i]]+(j-vol[i])*val[i]>dp[j]) dp[j]=dp[j-vol[i]]+(j-vol[i])*val[i]; //(j-vol[i])*val[i]只先建造种类为i的塔,然后再加上其后时间内的最优方案 if(dp[j]>=v) break; } if(j<ans) ans=j; } printf("%d\n",ans); } return 0;}
- zoj3623(更新顺序影响下的完全背包)
- ZOJ3623 Battle Ships (完全背包)
- ZOJ3623: Battle Ships(类完全背包)
- zoj3623-完全背包(向前插入)
- ZOJ3623:Battle Ships(完全背包)
- HDU 3466 Proud Merchants(某种顺序下的背包)
- zoj3623
- soj 3300 Stockholm Coins(完全背包的更新次数)
- (背包二)完全背包
- nyoj311完全背包(完全背包问题)
- noip2014 飞扬的小鸟 (01背包+完全背包)
- hdu5410(完全背包的依赖)
- 动态规划(完全背包的变形)
- 树链上的完全背包(树上倍增)
- 疯狂的采药(完全背包模板)
- 二维的完全背包
- 01背包与完全背包就差一个顺序
- Coins(完全背包)
- 博客第一天,以后会多多交流的!
- oracle建立用户、表空间,给用户分配权限并分配表空间
- 复数的实现
- mysql的条件函数
- C++设计模式之九--Prototype原型模式
- zoj3623(更新顺序影响下的完全背包)
- android触摸屏(CTP)驱动架构及流程图
- 近段时间学习的总结记录
- 新网站收录和快照良好排名全无的解决方案
- 死锁(deadlock)、活锁(livelock)与饿死(starvation)
- 杭电2099题输出两位数
- Future模式
- ios笔试题
- 救基友记1