#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
using namespace std;
struct node
{
double price;
int level;
vector<int> child;
bool r;
node()
{
r=true;
}
}A[100010];
int N;
double rootp,p;
double maxprice=-1;
int num=0;
void levelorder(int st)
{
queue<int> q;
q.push(st);
int preend=st,last=st;
int level=0;
while(!q.empty())
{
int top=q.front();
q.pop();
A[top].price=pow(p,level)*rootp;
if(A[top].r)
{
if(A[top].price>maxprice)
{
num=1;
maxprice=A[top].price;
}
else if(A[top].price==maxprice)
{
num++;
}
}
for(int i=0;i<A[top].child.size();i++)
{
q.push(A[top].child[i]);
last=A[top].child[i];
}
if(preend==top)
{
level++;
preend=last;
}
}
}
int main()
{
scanf("%d%lf%lf",&N,&rootp,&p);
p=1+p/100;
int s,root;
for(int i=0;i<N;i++)
{
scanf("%d",&s);
if(s!=-1)
{
A[s].child.push_back(i);
A[s].r=false;
}
else
{
root=i;
}
}
levelorder(root);
printf("%.2f %d",maxprice,num);
return 0;
}
PAT甲1090 Highest Price in Supply Chain(25 分)
最新推荐文章于 2021-02-21 12:27:27 发布