TOJ 4365 ZOJ 3623 Battle Ships / 完全背包
来源:互联网 发布:淘宝论坛 买家 编辑:程序博客网 时间:2024/06/04 05:39
Battle Ships
描述
Battle Ships is a new game which is similar toStar 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 takesti seconds to produce thei-th battle ship and this battle ship can make the tower lossli 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.
输入
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 followingN lines, each line contains two integerst 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 one line for each test case. An integer indicating the minimum time the player should spend to win the game.
样例输入
1 11 12 101 12 53 1001 103 2010 100
样例输出
245
http://blog.csdn.net/ten_three/article/details/14487499
#include <stdio.h>#include <string.h>struct node{int t;int l;}a[40];int dp[340];int max(int x,int y){return x > y ? x : y;}int main(){int n,l,i,j;while(scanf("%d %d",&n,&l)!=EOF){memset(dp,0,sizeof(dp));for(i = 1;i <= n; i++){scanf("%d %d",&a[i].t,&a[i].l);}for(i = 1;i <= n; i++){for(j = 1; j <= 330; j++){dp[j + a[i].t] = max(dp[j+a[i].t],dp[j] + j * a[i].l);}}for(i = 1; i <= 330; i++)if(dp[i] >= l)break;printf("%d\n",i);}return 0;}
- TOJ 4365 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(完全背包或者BFS)
- Battle Ships(完全背包)
- 完全背包 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
- zoj 3623 battle ships
- ZOJ 3623 Battle Ships
- ZOJ - 3623 - Battle Ships (01背包变形)
- JavaScript学习篇之——面向对象
- oracle11g导入dmp文件命令
- HIbernate笔记01全局配置
- android ro.hardware 属性修改。
- 中断线程Interrupt与Interrupted的用处
- TOJ 4365 ZOJ 3623 Battle Ships / 完全背包
- yii General error: 2014 Cannot execute queries while other unbuffered queries are active
- Linux操作系统文件系统基础知识详解
- dos界面下的sql语句
- less 命令
- sa--网卡自动重启
- power designer
- Android下结束进程的方法
- Navigate后如何暂停Webbrowser?