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
思路:这就是一棵树,要找到最大的深度和最大深度的节点数。用vector存树的数据,vector[father].push_back(i);用dfs来求数的深度和最大节点数。
#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int maxdepth=0,maxnum=0;
vector<int> a[100001];
int N,root;
double p,r;
void dfs(int m,int depth){
if(a[m].size()==0){
if(depth==maxdepth){
maxnum++;
}
if(depth>maxdepth){
maxdepth=depth;
maxnum=1;
}
}else{
for(int i=0;i<a[m].size();i++){
dfs(a[m][i],depth+1);
}
}
}
int main(){
cin>>N>>p>>r;
for(int i=0;i<N;i++){
int father;
cin>>father;
if(father==-1){
root=i;
}else{
a[father].push_back(i);
}
}
dfs(root,0);
printf("%.2f %d",p*pow((1+r/100),maxdepth),maxnum);
return 0;
}