ZOJ - 3623 - Battle Ships (01背包变形)
来源:互联网 发布:java中字符串的比较 编辑:程序博客网 时间:2024/06/06 01:50
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
思路:将时间翻转过来,让时间作为背包的容量来进行动态规划,,,
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#define INF 0x3fffffffusing namespace std;int t[105], l[105];int dp[505];//dp[i]表示在i这个时间以内所造成的最大伤害 int main() {int N, L;while(scanf("%d %d", &N, &L) != EOF) {for(int i = 1; i <= N; i++) {scanf("%d%d", &t[i], &l[i]);}memset(dp, 0, sizeof(dp));for(int i = 0; i <= 335; i++) {for(int j = 1; j <= N; j++) {dp[i + t[j]] = max(dp[i + t[j]], dp[i] + i * l[j] );}} int ans = INF;for(int i = 0; i <= 335; i++) {if(dp[i] >= L && ans > i) ans = i;}printf("%d\n", ans);}return 0;}
- ZOJ - 3623 - Battle Ships (01背包变形)
- ZOJ 3623 Battle Ships (完全背包)
- ZOJ 3623 Battle Ships(完全背包)
- ZOJ 3623 - Battle Ships(完全背包)
- ZOJ 3623 Battle Ships(完全背包)
- ZOJ-3623 Battle Ships (完全背包 应用题)
- ZOJ 3623 Battle Ships
- zoj 3623 Battle Ships
- ZOJ 3623 Battle Ships
- ZOJ 3623 Battle Ships
- ZOJ 3623 Battle Ships
- zoj 3623 battle ships
- ZOJ 3623 Battle Ships
- zoj 3623 Battle Ships(dp)
- ZOJ 3623 Battle Ships(dp)
- TOJ 4365 ZOJ 3623 Battle Ships / 完全背包
- ZOJ - 3623 Battle Ships(完全背包或者BFS)
- zoj 3623 Battle Ships dp
- iOS开发之如何访问通讯录
- 在windows下配置caffe
- 最长公共子序列
- Gulp 使用
- listview里面添加GridView,使其显示正常的GridView的高度
- ZOJ - 3623 - Battle Ships (01背包变形)
- 运算符优先级
- CSS 3D变换
- YUV格式
- 队员匹配问题
- 11.模型驱动与令牌拦截器
- 【机器学习实验】概率编程及贝叶斯方法
- 【iOS开发】block使用与理解
- UIScrollView+UIPageControl+NSTimer实现图片的自动滑动以及用户可手动切换,UIPageControl可点击