Communication System dp-动态规划

Communication System dp-动态规划

Time limit：1000 ms Memory limit：10000 kB Source: Tehran 2002, First Iran Nationwide Internet Programming Contest

描述

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 § is the sum of the prices of all chosen devices. Our goal is to choose a manufacturer for each device to maximize B/P.

输入

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.

输出

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.

Input

1 3
3 100 25 150 35 80 25
2 120 80 155 40
2 100 100 120 110

Output

0.649

代码

#include <iostream>
#include <algorithm>
#define _for(i, a) for(int i = 0; i < (a); i++)
#define _rep(i, a, b) for(int i = (a); i < (b); i++)
#define inf 0x3f3f3f3f
using namespace std;

int main() {
	//freopen("input.txt", "r", stdin);
	int T = 0;
	cin >> T;
	while (T--) {
		int n = 0;//n是设备数，m是各设备的生产厂家数
		int dp[100][400];//前i个设备带宽为j的最小费用
		_for(i, 100) {
			_for(j, 400) {
				dp[i][j] = inf;
			}
		}
		cin >> n;
		_for(i, n) {
			int num = 0;
			cin >> num;
			_for(j, num) {
				int b = 0, p = 0;
				cin >> b >> p;
				if (i != 0) {
					_for(k, 400) {
						if (dp[i - 1][k] != inf) {
							if (k > b)
								dp[i][b] = min(dp[i - 1][k] + p, dp[i][b]);
							else
								dp[i][k] = min(dp[i - 1][k] + p, dp[i][k]);
						}
					}
				}
				else
					dp[i][b] = min(dp[i][b], p);
			}
		}
		double ans = 0;
		_for(i, 400) {
			if (dp[n - 1][i] != inf) {
				ans = max(ans, 1.0*i / dp[n - 1][i]);
			}
		}
		printf("%.3f\n", ans);
	}
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~