题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805376476626944

做了1079以后，这道题就小意思了，一遍AC

代码

  1. #include<algorithm>
  2. #include<vector>
  3. #include<iostream>
  4. #include<cmath>
  5. using namespace std;
  7. const int maxn = 100010;
  8. struct Node{
  9.     vector<int> child;
  10. }node[maxn];
  12. //n是结点总数，p是根结点的供应商价格，r是每一层的增加百分比
  13. int n;
  14. double p, r, ans = 0;
  15. vector<double> ans_list;
  17. void DFS(int root, int depth){
  18.     if(node[root].child.size() == 0){
  19.         ans = p * pow(1 + r, depth);
  20.         ans_list.push_back(ans);
  21.     }
  22.     else {
  23.         for(int i = 0; i < node[root].child.size(); i++){
  24.             DFS(node[root].child[i], depth + 1);
  25.         }
  26.     }
  27. }
  29. int main(){
  30.     int id, root;
  31.     scanf("%d%lf%lf", &n, &p, &r);
  32.     r /= 100;
  33.     for(int i = 0; i < n; i++){
  34.         scanf("%d",&id);
  35.         if(id == -1) root = i;
  36.         else {
  37.             node[id].child.push_back(i);
  38.         }
  39.     }
  40.     DFS(root, 0);
  41.     int max_num = 0;
  42.     double max_value = -1;
  43.     for(int i = 0; i < ans_list.size(); i++){
  44.         if(ans_list[i] > max_value) max_value = ans_list[i];
  45.     }
  46.     for(int i = 0; i < ans_list.size(); i++){
  47.         if(ans_list[i] == max_value) max_num++;
  48.     }
  49.     printf("%.2f %d", max_value, max_num);
  50.     return 0;
  51. }