1090 Highest Price in Supply Chain(甲级)

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<iostream>
#include<vector>
#include<math.h>
using namespace std;
const int maxn = 100010;
int n;
double p, r;
double sum = 0;
struct info {//定义静态树double data;//货物量vector<int>v;//孩子节点
}node[maxn];
int num = 0;//相同深度的数量
int max_depth = 0;//最大深度
void dfs(int root, int depth)
{if (node[root].v.size() == 0)//到达叶子节点{if (max_depth == depth){num++;}else if(max_depth<depth){max_depth = depth;num = 1;}return;}for (int i = 0; i < node[root].v.size(); i++){dfs(node[root].v[i], depth + 1);//递归访问子节点}
}
int main()
{cin >> n >> p >> r;int child;int root;r /= 100;for (int i = 0; i < n; i++){cin >> child;if (child != -1){node[child].v.push_back(i);}else{root = i;}}dfs(root, 0);printf("%.2lf %d", p * pow(1 + r, max_depth),num);
}

1090 Highest Price in Supply Chain(甲级)相关推荐

PAT甲级1090 Highest Price in Supply Chain：[C++题解]树、结点到根结点的距离、记忆化搜索、树形dp
文章目录题目分析题目链接题目分析来源:acwing 和PAT甲级1079 Total Sales of Supply Chain:[C++题解] 树.结点到根结点的距离.树形dp.记忆化搜索是 ...
1090 Highest Price in Supply Chain （25 分）
1090 Highest Price in Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributor ...
PAT甲级 -- 1090 Highest Price in Supply Chain (25 分)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090. Highest Price in Supply Chain (25)-PAT甲级真题
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090 Highest Price in Supply Chain (25)（25 分）
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090. Highest Price in Supply Chain (25)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090 Highest Price in Supply Chain (25)
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090 Highest Price in Supply Chain （25 分）(模拟建树，找树的深度)牛客网过，pat没过...
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...
1090 Highest Price in Supply Chain（天上人间，潇潇共雨。曼珠红遍，流水忘川。）
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone invo ...

1090 Highest Price in Supply Chain(甲级)

1090 Highest Price in Supply Chain(甲级)相关推荐

最新文章

热门文章