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
题意：给出一棵销售供应的树，树根唯一。在树根处货物的价格为P,然后从根结点开始每往子结点走一层，该层的货物价格将会在父亲结点上增加r%。求所有叶结点中的最高价值以及这个价格的叶结点个数。

#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=100010;
vector<int> child[maxn];//存放树
double p,r;
//mathDepth为最大深度，num为最大深度的叶结点个数
int n,maxDepth=0,num=0;
void DFS(int index,int depth)
{
	if(child[index].size()==0)
	{
		//到达叶结点
		if(depth>maxDepth)
		{
			//深度比最大深度大
			//更新最大深度
			maxDepth=depth;
			num=1;//重置最大深度的叶结点个数为1 
		}
		else if(depth==maxDepth)
		{
			//最大深度等于深度
			num++; 
		}
		return;
		  
	}
	for(int i=0;i<child[index].size();i++)
	{
		DFS(child[index][i],depth+1);
		//递归访问结点index的子结点 
	}
} 
int main()
{
	int father,root;
	scanf("%d%lf%lf",&n,&p,&r);
	r/=100;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&father);
		if(father!=-1)
		{
			child[father].push_back(i);
	        //i是father的子结点 
		}
		else{
			root=i;
		}
	}
	DFS(root,0);
	printf("%.2f %d\n",p*pow(1+r,maxDepth),num);
	return 0;
}