https://pintia.cn/problem-sets/994805342720868352/problems/994805376476626944
就是找深度最深的叶节点的深度，和最深的结点个数。
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
vector<int>ve[N];
int n,deep,cnt;
double p,r;
void dfs(int u,int fa,int step)
{
if(ve[u].size()==0)
{
if(deep==step) cnt++;
else if(deep<step) deep=step,cnt=1;
return;
}
for(int i=0;i<ve[u].size();i++)
{
if(ve[u][i]==fa) continue;
dfs(ve[u][i],u,step+1);
}
}
int main(void)
{
cin>>n>>p>>r;
r/=100;
for(int i=1;i<=n;i++)
{
int x; cin>>x;
x++;//让其从下标[0-n]
ve[x].push_back(i);
}
dfs(0,-1,0);
printf("%.2lf ",p*pow(1+r,deep-1));
cout<<cnt<<endl;
return 0;
}