zoj 3623 Battle Ships dp

最新推荐文章于 2019-04-15 16:29:11 发布

joafelnglfds

最新推荐文章于 2019-04-15 16:29:11 发布

阅读量772

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/is_cp/article/details/41285913

版权

动态规划专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Description

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 t_i seconds to produce the i-th battle ship and this battle ship can make the tower loss l_i 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 l_i(1 ≤ l_i ≤ 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

Sample Output

2
4
5

题意及分析：

因为每次可以选择做或不做。所以当然选择建一个战舰。dp[j]表示j的时间内造成的伤害。dp[j+t[i]]前t[i]的时间来建战舰。剩余的j的时间则有可以看做一个小的整体。dp[j+t[i]]=max(dp[j+t[i]],dp[j]+j*a[i]]);这就是需要的递推式。

AC代码：

   
   
    
    #include
      
      
       
       
#include
       
       
        
        
#include
        
        
         
         
#include
         
         
          
          
#include
          
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
                #include 
                
                  #define ll long long #define eps 1e-9 #define pi acos(-1.0) #define INF 0x3f3f3f3f #define M 5e3+10 #define MAXINT (1<<31)-1 using namespace std; int dp[500],a[50],t[50]; int main() { int N,L; while(~scanf("%d%d",&N,&L)) { int i,j; memset(dp,0,sizeof(dp)); for(i=1;i<=N;i++) scanf("%d%d",&t[i],&a[i]); for(i=0;i<=L;i++) for(j=1;j<=N;j++) dp[i+t[j]]=max(dp[i+t[j]],dp[i]+i*a[j]); for(i=1;i<=L;i++) if(dp[i]>=L) break; printf("%d\n",i); } return 0; }

joafelnglfds

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
zoj 3623 Battle Ships dp

DescriptionBattle 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
复制链接

扫一扫