# PAT甲级 A1090

## 题目详情

1090 Highest Price in Supply Chain (25分)
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 (≤10
​5
​​ ), 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 S
​i
​​ is the index of the supplier for the i-th member. S
​root
​​ 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 10
​10
​​ .

Sample Input:
9 1.80 1.00
1 5 4 4 -1 4 5 3 6
Sample Output:
1.85 2

## 解题思路

#include <cstdio>
#include <algorithm>
#include<iostream>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
int N; double p1, r1;
class node{
public:
vector<int> backs;
};
vector<node> tree(100100);
double prices = 0;
int nos = 0;
void DFS(int a,double p) {
if (tree[a].backs.size() == 0) {
if (p > prices) {
prices = p;
nos = 1;
}
else if(p==prices){
nos++;
return;
}
else {
return;
}
}
else {
for (int i = 0; i < tree[a].backs.size(); i++) {
double price = p * (1 + 0.01 * r1);
DFS(tree[a].backs[i], price);
}
}
}
int main() {
cin >> N >> p1 >> r1;
int begins=0;
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
if (temp == -1) {
begins = i;
}
else {
tree[temp].backs.push_back(i);
}
}
DFS(begins,p1);
cout <<fixed<<setprecision(2)<<prices << " " << nos << '\n';

}



02-07 92

12-01 511

11-16 103

03-31 40

08-25 96

02-13 90

02-20 57

02-07 42

04-29 8956

08-12 3381

03-16 84

01-16 56

08-21 546

03-13 182

01-26 136

12-12 8406

12-28 74

08-27 488

07-10 21万+

#### Java 最常见的 200+ 面试题：面试必备

©️2020 CSDN 皮肤主题: 1024 设计师: 上身试试

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。