zoukankan      html  css  js  c++  java
  • 1090 Highest Price in Supply Chain (25)(25 分)

    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^5^), 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~i~ 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^10^.

    Sample Input:

    9 1.80 1.00
    1 5 4 4 -1 4 5 3 6
    

    Sample Output:

    1.85 2
    #include<cstdio>
    #include<cmath>
    #include<vector>
    using namespace std;
    const int maxn = 100010;
    vector<int> child[maxn];
    int n,maxDepth = 0,num =0 ;
    double p,r;
    
    void DFS(int index,int depth){
        if(child[index].size() == 0){
            if(depth > maxDepth){
                maxDepth = depth;
                num = 1;
            }else if(depth == maxDepth){
                num++;
            }
            return;
        }
        for(int i = 0; i < child[index].size(); i++){
            DFS(child[index][i],depth+1);
        }
    }
    
    int main(){
        scanf("%d%lf%lf",&n,&p,&r);
        int father,root;
        r /= 100;
        for(int i = 0; i < n; i++){
            scanf("%d",&father);
            if(father != -1){
                child[father].push_back(i);
            }
            else{
                root = i;
            }
        }
        DFS(root,0);
        printf("%.2f %d
    ",p*pow(1+r,maxDepth),num);
        return 0;
    }
  • 相关阅读:
    oracle里的tns是什么意思
    什么是联机分析处理(OLAP)
    JDBC和ODBC
    mysql 乱码
    eclipse常用快捷键和插件
    数仓项目01:准备工作
    github、maven、idea初始化一个项目
    数仓项目02:集群搭建
    数仓项目03:数据采集层(Flume+Kafka)
    Java Swing 日期控件(转载)
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/9291501.html
Copyright © 2011-2022 走看看