PAT A1090 highest price of supply chain（25）

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int n,maxlayer=1;
double rootprice,rttsum=0,r;
struct node{
double price;//layer function
int layer;
int num;
vector<int> receive;
}node[100010];
void BFS(int root){
queue<int> q;
node[root].price=rootprice;
node[root].layer=1;
q.push(root);
while(!q.empty()){
int front=q.front();
q.pop();
for(int i=0;i<node[front].receive.size();i++){
node[node[front].receive[i]].layer=node[front].layer+1;
//node[node[front].receive[i]].price=node[front].price*(1+(r/100));
if(node[node[front].receive[i]].layer>maxlayer) maxlayer=node[node[front].receive[i]].layer; 
q.push(node[front].receive[i]);
}


}
int num=0;
double maxprice;
maxprice=rootprice*pow(1+r,maxlayer-1);
for(int i=0;i<n;i++){
if(node[i].layer==maxlayer){
num++;
}
}
printf("%.2f %d\n",maxprice,num);
}
int main(){
scanf("%d%lf%lf",&n,&rootprice,&r);
r/=100;
int i,k,pnum,j,id,root;
for(i=0;i<n;i++){
scanf("%d",&k);
if(k!=-1) node[k].receive.push_back(i);
else root=i;
}
BFS(root);
system("pause");
return 0;
}