zoukankan      html  css  js  c++  java
  • 1090 Highest Price in Supply Chain (25 分)(模拟建树,找树的深度)牛客网过,pat没过

    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<iostream>
    #include<cstring>
    #include<algorithm>
    
    using namespace std;
    
    int main()
    {
    	
    	int n;
    	double a,b;
    	scanf("%d%lf%lf",&n,&a,&b);
    	int pre[100005];
    	int k,m;
    	for(int t=0;t<n;t++)
    	{
    		scanf("%d",&k);
    		if(k!=-1)
    		pre[t]=k;
    		else
    		{
    			pre[t]=t;
    			m=t;
    		}
    		
    	}
    	
    	int sum[100005]={0};
    	int p;
    	for(int t=0;t<n;t++)
    	{
    		p=t;
    		
    		while(pre[p]!=m)
    		{
    			
    			sum[t]++;
    			p=pre[p];
    			
    			
    		}
    	}
    	sort(sum,sum+n);
    	int sum1=0;
    	for(int t=0;t<n;t++)
    	{
    		if(sum[t]==sum[n-1])
    		{
    			sum1++;
    		}
    	}
    	double s=a;
    	for(int t=0;t<sum[n-1]+1;t++)
    	{
    		s=s+s*0.01*b;
    	}
    	printf("%.2f %d
    ",s,sum1);
    	return 0;
    }
  • 相关阅读:
    DP:Multiplication Puzzle(POJ 1651)
    Heap:Expedition(POJ 2431)
    velocity.js 动画插件
    ES6 新特性
    ps p图
    php 建站 多域名配置 自定义重定向
    移动端开发 资源分享
    拖拽 初体验
    颜色选择器 rgb 与16进制 颜色转换
    web 常用颜色
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10782048.html
Copyright © 2011-2022 走看看