POJ1018Communication System题解动态规划DP
来源:互联网 发布:淘宝达人推荐 编辑:程序博客网 时间:2024/05/23 15:57
Communication System
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12607 Accepted: 4377
Description
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.
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 33 100 25 150 35 80 252 120 80 155 402 100 100 120 110
Sample Output
0.649
Source
Tehran 2002, First Iran Nationwide Internet Programming Contest
状态:
设d[i][j]表示前i组带宽为j时的最小价格
状态转移方程:
d[i][j]=min{d[i-1][j]+p[i][k]}; (b[i][k]>=j)
ans=max{j/d[n][j]}
j枚举到400
代码:
- POJ1018Communication System题解动态规划DP
- poj1018Communication System dp
- poj1018Communication System-dp
- POJ1018Communication System
- Bookshelf题解动态规划DP
- POJ2353Ministry题解动态规划DP
- POJ1260Pearls题解动态规划DP
- HDU2845Beans题解动态规划DP
- POJ3356AGTC题解动态规划DP
- POJ1745Divisibility题解动态规划DP
- HDU3449Consumer题解动态规划DP
- POJ2626Chess题解动态规划DP
- POJ1837Balance题解动态规划DP
- POJ3661Running题解动态规划DP
- POJ2229Sumsets题解动态规划DP
- POJ1036Gangsters题解动态规划DP
- POJ3073Spam题解动态规划DP
- POJ1404I-Keyboard题解动态规划DP
- could not find a getter for ... in class ...
- 递归遍历某文件夹下所有文件的算法
- 虚函数,纯虚函数相关
- 使用C#旋转图像
- FireFox中得到file控件取到客户端文件的完整路径
- POJ1018Communication System题解动态规划DP
- [转]RTSP服务器处理客户端点播的基本流程
- MEF程序设计指南九:重组(Recomposition)MEF部件
- 折腾 Win7
- WINCE的内存配置-config.bib文件的解析
- c# 捕获的异常写到日志里
- pl/sql存储过程(procedure)傻瓜入门教程
- SQL 中in传入字符串的处理
- 虚函数和纯虚函数 是动态联编的