【PAT】1090. Highest Price in Supply Chain

考查点：树的遍历，计算树的最大层数

思路：利用Vector存放树的叶节点，DFS深搜，记录最大层数

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i > = y; i--)
#define MAXN 10005
#define oo 0x3f3f3f3f
using namespace std;
int n;

int ans;
int num;
const int maxn=100010;
vector<int> child[maxn];
void inorder(int root,int len){


    if(child[root].size()==0){
        if(len>ans){
            ans=len;
            num=1;

        }else if(len==ans) num++;
        return;
    }
    FOR(k,0,child[root].size())
    {
        inorder(child[root][k],len+1);
    }
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL
    double p,r;
    int root;
    int fa;
    scanf("%d%lf%lf",&n,&p,&r);
    FOR(i,0,n)
    {
        scanf("%d",&fa);
        child[fa].push_back(i);
        if(fa==-1) root=i;
    }

    inorder(root,0);

    printf("%.2f %d",p*pow(1+r/100,ans),num);
    return 0;
}