1090- Highest Price in Supply Chain (25)

1003

题目:

题目描述

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.

输入描述:

Each input file contains one test case.  For each case, The first line contains three positive numbers: N (<=105), 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 Si is the index of the supplier for the i-th member.  Sroot for the root supplier is defined to be -1.  All the numbers in a line are separated by a space.

输出描述:

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 1010.

 输入例子:

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

输出例子:

1.85 2

算法分析

树:DFS

浮点数的处理。

本题中树的表示方式:通过父节点连接。故可以构造一个struct tree其中包含父节点指针和该节点对应的价钱。

这里要注意浮点数的大小判断方法。设置一个极小量ep,比较浮点数的差与ep的关系(高数中求极限的方法)。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const double EP = 1e-7;
const int MAXN = 100000001;
typedef struct Tree{
	int father;
	double price;
}Tree;
double startPrice, rate;
int num;
Tree tree[MAXN];

void Input() {
	cin >> num >> startPrice >> rate;
	rate /= 100;
	for (int i = 0; i < num; i++)
		tree[i].price = 0;
	for (int i = 0; i < num; i++) {
		cin >> tree[i].father;
		if (tree[i].father < 0)
			tree[i].price = startPrice;
	}
}

double GetPrice(int x) {
	if (tree[x].father < EP)
		return tree[x].price;
	return (GetPrice(tree[x].father))*(1.0 + rate);
}

int main(void) {
	Input();
	for (int i = 0; i < num; i++)
		if (tree[i].father > 0)
			tree[i].price = GetPrice(i);

	double maxPrice = -1;
	int maxNum = 0;
	for (int i = 0; i < num; i++)
		if (maxPrice < tree[i].price) {
			maxPrice = tree[i].price;
			maxNum = 1;
		}
		else if (maxPrice == tree[i].price)
			maxNum++;
	
	printf("%.2f %d\n", maxPrice,maxNum);

	system("pause");
	return 0;
}

 

资源下载链接为: https://pan.quark.cn/s/22ca96b7bd39 在当今的软件开发领域,自动化构建与发布是提升开发效率和项目质量的关键环节。Jenkins Pipeline作为一种强大的自动化工具,能够有效助力Java项目的快速构建、测试及部署。本文将详细介绍如何利用Jenkins Pipeline实现Java项目的自动化构建与发布。 Jenkins Pipeline简介 Jenkins Pipeline是运行在Jenkins上的一套工作流框架,它将原本分散在单个或多个节点上独立运行的任务串联起来,实现复杂流程的编排与可视化。它是Jenkins 2.X的核心特性之一,推动了Jenkins从持续集成(CI)向持续交付(CD)及DevOps的转变。 创建Pipeline项目 要使用Jenkins Pipeline自动化构建发布Java项目,首先需要创建Pipeline项目。具体步骤如下: 登录Jenkins,点击“新建项”,选择“Pipeline”。 输入项目名称和描述,点击“确定”。 在Pipeline脚本中定义项目字典、发版脚本和预发布脚本。 编写Pipeline脚本 Pipeline脚本是Jenkins Pipeline的核心,用于定义自动化构建和发布的流程。以下是一个简单的Pipeline脚本示例: 在上述脚本中,定义了四个阶段:Checkout、Build、Push package和Deploy/Rollback。每个阶段都可以根据实际需求进行配置和调整。 通过Jenkins Pipeline自动化构建发布Java项目,可以显著提升开发效率和项目质量。借助Pipeline,我们能够轻松实现自动化构建、测试和部署,从而提高项目的整体质量和可靠性。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值