ZOJ3623 Battle Ships (完全背包)
来源:互联网 发布:用c语言编写一个图形 编辑:程序博客网 时间:2024/06/10 03:09
Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which hasL longevity. The player has a military factory, which can produce N kinds of battle ships. The factory takes ti seconds to produce thei-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) andL(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 integerst i(1 ≤ t i ≤ 20) andli(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
题意:有n种船 给出造出每种船的时间 和 该船一秒可以打多少滴血,给出L总血量,问打到L滴血最少需要多少秒。
设dp[i] 代表第i秒最多可以打掉多少滴血 那么答案就是从第0秒开始枚举 找到第一个大于等于L的就结束。
dp[j+t[i]] = max{ dp[i+t[i]], dp[j] + l[i]*j }
#include <algorithm>#include <cstdio>#include <vector>#include <cmath>#include <queue>#include <set>#include <map>#include <cstring>#include <cstdlib>#include <iostream>//#include <bits/stdc++.h>#define MAX 0x3f3f3f3f#define N 100005#define M 200005#define mod 1000000007#define lson o<<1, l, m#define rson o<<1|1, m+1, rtypedef long long LL;using namespace std;const double pi = acos(-1.0);int n, m;int t[40], l[40], dp[40000];int main(){ //freopen("in.txt","r",stdin); while(~scanf("%d%d", &n, &m)) { for(int i = 0; i < n; i++) { scanf("%d%d", &t[i], &l[i]); } memset(dp, 0, sizeof(dp)); for(int i = 0; i < n; i++) { for(int j = 0; j <= 340; j++) { dp[ t[i] + j ] = max(dp[ t[i] + j ], dp[j] + j*l[i]); } } for(int i = 0; i < 400; i++) { if(dp[i] >= m) { printf("%d\n", i); break; } } }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-完全背包(向前插入)
- hdu 1272 小希的迷宫
- leetcode_Number of 1 Bits
- java.lang.OutOfMemoryError: PermGen space及其解决方法
- 大巧不工Web前端设计修炼之道——(7)让你的设计更加完美——优化技巧和最佳实践
- hdu 3371 Connect the Cities(最小生成树kruskal)
- ZOJ3623 Battle Ships (完全背包)
- UVA11235
- char varchar varchar2 的区别
- codeforces 294 div2.C
- 蓝桥杯--比酒量
- uvalive 4108(线段树)
- 国企的MySQL选型方案
- java.lang.OutOfMemoryError: Java heap space如何解决?
- 2015-第5周项目4-静态成员应用