zoukankan      html  css  js  c++  java
  • Battle Ships 动态规划

    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 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 i(1 ≤ 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 1
    1 1
    2 10
    1 1
    2 5
    3 100
    1 10
    3 20
    10 100
    
    

    Sample Output

    2
    4
    5
    ***********************************************************************************************************************************************************
     1 /*
     2 完全背包,每次优化前j时间的最大破坏量
     3 最后递推出最优值。
     4 */
     5 #include<iostream>
     6 #include<string>
     7 #include<cstring>
     8 #include<cmath>
     9 #include<cstdio>
    10 using namespace std;
    11 int dp[1001];
    12 int t[1001],p[1001];
    13 int n,m,i,j,k;
    14 int main()
    15 {
    16    while(scanf("%d %d",&n,&m)!=EOF)
    17    {
    18       for(i=1;i<=n;i++)
    19       {
    20          scanf("%d %d",&t[i],&p[i]);
    21       }
    22       memset(dp,0,sizeof(dp));
    23       for(i=1;i<=n;i++)
    24        for(j=0;j<400;j++)
    25        {
    26           dp[j+t[i]]=max(dp[j+t[i]],dp[j]+j*p[i]);
    27        }
    28        for(j=0;j<400;j++)
    29         if(dp[j]>=m)
    30         {
    31          printf("%d
    ",j);
    32          break;
    33         }
    34    }
    35    return 0;
    36 }
    View Code
  • 相关阅读:
    redis集群
    鉴权方案选择
    spring mvc 自定义handler不拦截静态资源
    servlet3
    压测工具 ab jmeter
    死锁产生的原因
    缓存方案:本地guavaCache, 远程redis?
    使用spring boot admin
    groovy使用小记
    python--面试题01
  • 原文地址:https://www.cnblogs.com/sdau--codeants/p/3435432.html
Copyright © 2011-2022 走看看