zoukankan      html  css  js  c++  java
  • poj-1018

    /*
     We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufacturers. Same devices from two manufacturers differ in their maximum bandwidths and prices.
     By overall bandwidth (B) we mean the minimum of the bandwidths of the chosen devices in the communication system and the total price (P) is the sum of the prices of all chosen devices. Our goal is to choose a manufacturer for each device to maximize B/P.
     Input
     
     The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by the input data for each test case. Each test case starts with a line containing a single integer n (1 ≤ n ≤ 100), the number of devices in the communication system, followed by n lines in the following format: the i-th line (1 ≤ i ≤ n) starts with mi (1 ≤ mi ≤ 100), the number of manufacturers for the i-th device, followed by mi pairs of positive integers in the same line, each indicating the bandwidth and the price of the device respectively, corresponding to a manufacturer.
     Output
     
     Your program should produce a single line for each test case containing a single number which is the maximum possible B/P for the test case. Round the numbers in the output to 3 digits after decimal point.
     
     Sample Input
     
     1 3
     3 100 25 150 35 80 25
     2 120 80 155 40
     2 100 100 120 110
     Sample Output
     
     0.649
     */
    
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    
    using namespace std;
    
    const int inf = 0x3f3f3f3f;
    int dp[120][1200];
    
    int main()
    {
        int t,n,mi,p,b;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&n);
            for(int i = 0; i <= n; i++)
            {
                for(int j = 0; j <= 1100; j++)
                {
                    dp[i][j] = inf;
                }
            }
            for(int i = 1; i <= n; i++)
            {
                scanf("%d",&mi);
                for(int j = 1; j <= mi; j++)
                {
                    scanf("%d%d",&b,&p);
                    if(i == 1){
                        dp[i][b] = min(p,dp[i][b]);
                    }
                    else
                    {
                        for(int z = 1; z <= 1100; z++)
                        {
                            if(dp[i-1][z] != inf)
                            {
                                if(z <= b)
                                    dp[i][z] = min(dp[i][z],dp[i-1][z] + p);
                                else
                                    dp[i][b] = min(dp[i][b],dp[i-1][z] + p);
                            }
                        }
                    }
                }
            }
            double ans = 0;
            for(int i = 1; i <= 1100; i++){
                if(dp[n][i] != inf)
                    ans = max(ans, (double)i / dp[n][i]);
            }
            printf("%.3lf
    ",ans);
        }
        return 0;
    }
    
  • 相关阅读:
    HttpClient 用法
    HttpURLConnection 用法
    Android 真机连接本地PC服务器
    ArrayList VS Vector
    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    Implicit super constructor xx() is undefined for default constructor
    layout_gravity
    gravity
    eclipse 建多层包
    RFC 4585 基于实时传输控制协议(RTCP)反馈的扩展RTP(RTP/AVPF)配置文件
  • 原文地址:https://www.cnblogs.com/kishi/p/10320752.html
Copyright © 2011-2022 走看看