zoj3623 Battle Ships
来源:互联网 发布:化学反应速率实验数据 编辑:程序博客网 时间:2024/05/21 14:56
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
这题比较难想到,看了题解后才恍然大悟。。这里把时间看做容量,所打怪物的血为价值,用dp[j]表示j这个时候最多能打怪物的血量,那么利用完全背包可以得到dp[j]=max(dp[j],dp[j-t[i]]+(j-t[i])*l[i]),其中dp[j-t[i]]是因为刚开始制造要花t[i]时间,后面指的是制造出来后的每一秒可以打多少血。
#include<stdio.h>#include<string.h>int max(int a,int b){return a>b?a:b;}int dp[500];int main(){int n,m=490,last,i,j;int t[50],l[50];while(scanf("%d%d",&n,&last)!=EOF){for(i=1;i<=n;i++){scanf("%d%d",&t[i],&l[i]);}memset(dp,0,sizeof(dp));for(i=1;i<=n;i++){for(j=t[i];j<=m;j++){dp[j]=max(dp[j],dp[j-t[i]]+(j-t[i])*l[i]);}}for(i=1;i<=m;i++){if(dp[i]>=last){printf("%d\n",i);break;}}}return 0;}
- zoj3623 Battle Ships DP
- ZOJ3623 Battle Ships
- zoj3623 Battle Ships
- 【zoj3623】【Battle Ships】
- ZOJ3623 Battle Ships
- ZOJ3623:Battle Ships(完全背包)
- ZOJ3623 Battle Ships (完全背包)
- ZOJ3623: Battle Ships(类完全背包)
- Battle Ships
- ZOJ 3623 Battle Ships
- zoj 3623 Battle Ships
- ZOJ 3623 Battle Ships
- Battle Ships(完全背包)
- hdu 5093 Battle ships
- ZOJ 3623 Battle Ships
- ZOJ 3623 Battle Ships
- zoj 3623 battle ships
- HDU 5093 Battle ships
- Contains Duplicate III
- 中国最大火箭发射平台
- Vb程序运行时出现"找不到工程或库"
- java内存分配和String类型的深度解析
- iOS开发笔记之四十——一个诡异的编译报错问题
- zoj3623 Battle Ships
- textField 真机上键盘不弹出
- 【华为oj】放苹果
- JAXB 实现JavaBean与xml互转(一)
- LeetCode || Pascal's Triangle II
- Maven实战(四)——基于Maven的持续集成实践
- Eclipse插件安装
- Android一些关键函数和类的分析-ActivityManager
- 仰光中文离线地图App上线