1090 Highest Price in Supply Chain (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:200 ms
内存限制:64 MB
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.
Starting from one root supplier, everyone on the chain buys products from one’s supplier in a price P and sell or distribute them in a price that is r% higher than P. It is assumed that each member in the supply chain has exactly one supplier except the root supplier, and there is no supply cycle.
Now given a supply chain, you are supposed to tell the highest price we can expect from some retailers.
Input Specification:
Each input file contains one test case. For each case, The first line contains three positive numbers: N (≤105 ), the total number of the members in the supply chain (and hence they are numbered from 0 to N−1); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then the next line contains N numbers, each number Si is the index of the supplier for the i-th member. Sroot for the root supplier is defined to be −1. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the highest price we can expect from some retailers, accurate up to 2 decimal places, and the number of retailers that sell at the highest price. There must be one space between the two numbers. It is guaranteed that the price will not exceed 1010 .
Sample Input:
9 1.80 1.00
1 5 4 4 -1 4 5 3 6
Sample Output:
1.85 2
题意:
供应商发货给经销商,价格从p,卖到(1+r)*p,经销商也可以转给经销商,价格也是(1+r)倍,最后到零售商出售,求最贵的售价,即转手最多次的售价。如例题,经销商1转手给了0,经销商5转手给了2,…,4号是供应商。
思路:
即树的遍历,用dfs深度优先遍历,当没有下家时即为边界,然后判断层数,并记录最大层数的路径数量。
参考代码:
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int n, index, st, cnt = 1, maxdepth = -1;
double p, r;
vector<vector<int> > v;
void dfs(int root, int depth) {
if (v[root].empty()) {
if (depth > maxdepth) {
maxdepth = depth;
cnt = 1;
} else if (depth == maxdepth)
cnt++;
return;
}
for (int i = 0; i < v[root].size(); i++)
dfs(v[root][i], depth + 1);
}
int main() {
scanf("%d%lf%lf", &n, &p, &r);
v.resize(n);
r = 1 + r / 100;
for (int i = 0; i < n; i++) {
scanf("%d", &index);
if (index != -1)v[index].push_back(i);
else st = i;
}
dfs(st, 0);
printf("%.2f %d", p * pow(r, maxdepth), cnt);
}
如有错误,欢迎指正