zoukankan      html  css  js  c++  java
  • Battle Ships(复习泛化物品**)

    传送门
    Battle Ships

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

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

    Sample Output

    2
    4
    5
    
    

    Author: FU, Yujun
    Contest: ZOJ Monthly, July 2012
     
    【题目大意】有l滴血,你有n个战舰,生产每个战舰需要时间,生产后每秒攻击i点血,求耗完l滴血的最少时间。
    【code】
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int f[340],protim[40],fi[40];
    int n,l,i,j;
    int main()
    {
        while(scanf("%d%d",&n,&l)!=EOF)
        {
            memset(f,0,sizeof(f));
            for(i=1;i<=n;i++)
            scanf("%d%d",&protim[i],&fi[i]); 
            for(i=1;i<=l;i++)
            for(j=1;j<=n;j++)
            f[i+protim[j]]=max(f[i+protim[j]],f[i]+i*fi[j]);
            for( i=1;i<=340;i++)
            if(f[i]>=l)break;
            printf("%d
    ",i);
        }
        return 0;
    }
  • 相关阅读:
    Python 日期格式化 及 schwartzian排序
    好的数据源
    董的博客 hadoop
    hadoop 2.2.0 集群部署 坑
    python 单元测试
    减少前端代码耦合
    jQuery $.ajax传递数组的traditional参数传递必须true
    如何做一个大格局的人
    中国各省市县级 JSON 文件
    用v-for进行table循环
  • 原文地址:https://www.cnblogs.com/zzyh/p/7056339.html
Copyright © 2011-2022 走看看