原题链接:A1090 Highest Price in Supply Chain
#include<algorithm>
#include<iostream>
#include<cstdio>
#include <cmath>
#include <vector>
using namespace std;
typedef struct PTNode
{
vector<int> child;
} PTNode;
PTNode PTree[100010];
int N, ROOT_ID, max_deep = 0, max_deep_num = 0;//最大深度和最大深度的数量
double P, R;
void DFS(int ID, int deep)//深度优先搜索思想,或者说先根遍历思想
{
vector<int> Child = PTree[ID].child;
if(!Child.size())//叶节点
{
if(deep == max_deep) max_deep_num++;//同样是最大深度,则计数
else if(deep > max_deep)//更新
{
max_deep = deep;
max_deep_num = 1;
}
}
for(int i=0; i<Child.size(); i++) DFS(PTree[ID].child[i], deep+1);//该孩子递归
}
int main()
{
scanf("%d %lf %lf", &N, &P, &R);
for(int i=0, father_id; i<N; i++)
{
scanf("%d", &father_id);//输入的父亲的id号
if(father_id == -1) ROOT_ID = i;//根节点
else (PTree[father_id].child).push_back(i);
}
DFS(ROOT_ID, 0);
printf("%.2lf %d", P*pow(1.0+R*0.01, max_deep), max_deep_num);//售价直接根据深度计算出来
return 0;
}