1090 Highest Price in Supply Chain （25 分）(树的遍历，dfs)

最新推荐文章于 2020-06-24 18:48:56 发布

原创最新推荐文章于 2020-06-24 18:48:56 发布 · 197 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

c++ 同时被 2 个专栏收录

115 篇文章

订阅专栏

甲级

92 篇文章

订阅专栏

本文介绍了一种计算供应链中产品从供应商到零售商价格递增的方法。在一个由零售商、分销商和供应商组成的网络中，从根供应商开始，每个成员以一定百分比的价格增加购买并销售产品。文章提供了算法实现，用于确定零售商可能遇到的最高价格及达到该价格的零售商数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer.

Starting from one root supplier, everyone on the chain buys products from one's supplier in a price P and sell or distribute them in a price that is r% higher than P. It is assumed that each member in the supply chain has exactly one supplier except the root supplier, and there is no supply cycle.

Now given a supply chain, you are supposed to tell the highest price we can expect from some retailers.

Input Specification:

Each input file contains one test case. For each case, The first line contains three positive numbers: N (≤10

), the total number of the members in the supply chain (and hence they are numbered from 0 to N−1); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then the next line contains N numbers, each number S

is the index of the supplier for the i-th member. S

root

for the root supplier is defined to be −1. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the highest price we can expect from some retailers, accurate up to 2 decimal places, and the number of retailers that sell at the highest price. There must be one space between the two numbers. It is guaranteed that the price will not exceed 10

Sample Input:

9 1.80 1.00

1 5 4 4 -1 4 5 3 6

Sample Output:

1.85 2

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
#include <unordered_set>
using namespace std;
int n,maxdepth=0,maxnum=0,temp,root;
vector<int> v[100010];
void dfs(int index,int depth){
    if(v[index].size()==0){
        if(depth>maxdepth){
            maxdepth=depth;
            maxnum=1;
        }else if(depth==maxdepth){
            maxnum++;
        }
        return;
    }
    for(int i=0;i<v[index].size();i++)
        dfs(v[index][i],depth+1);
}
int main(){
    double p,r;
    cin>>n>>p>>r;
    r/=100;
    for(int i=0;i<n;i++){
        cin>>temp;
        if(temp==-1)
            root=i;
        else
            v[temp].push_back(i);
    }
    dfs(root,0);
    printf("%.2f %d",p*pow(1+r,maxdepth),maxnum);
    return 0;
}