PAT——A1090 Highest Price in Supply Chain(树的遍历）

题目链接：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
#define maxn 100010
vector<int >child[maxn];
int maxDepth=0,num=0;
int n;
double p,r;
void DFS(int index,int depth)
{
    if(child[index].size()==0)
    {
        if(depth>maxDepth)
        {
            maxDepth=depth;
            num=1;
        }
        else if(depth==maxDepth)
        {
           num++;
        }
    }
    for(int i=0;i<child[index].size();i++)
    {
        DFS(child[index][i],depth+1);
    }
}
int main()
{
    scanf("%d%lf%lf",&n,&p,&r);
    r/=100;
    int root;
    int father;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&father);
        if(father!=-1)
        {
            child[father].push_back(i);
        }
        else
            root=i;
    }
    DFS(root,0);
    printf("%.2f %d\n",p*pow(1+r,maxDepth),num);
    return 0;
}