PAT 1090 Highest Price in Supply Chain

这道题用BFS求出最大层次以及最大层次上节点的个数就好了

//这道题用BFS求出最大层次以及最大层次上节点的个数就好了
#include <stdio.h>
#include <queue>
#include <vector>
#include <math.h>
using namespace std;
struct Answer{
    int level;
    int num;
};//将每个层次上有多少个节点都记录下来。
vector<Answer> ans;
vector<int> vec[100008];//作为图的邻接链表。
queue<int>q;
int n;
double p,r;
int first,last,num,level;
void BFS(){
    while (!q.empty()) {
        first=q.front();
        int index=q.front();
        q.pop();
        num++;
        for (int i=0;i<vec[index].size() ; i++) {
            q.push(vec[index][i]);
        }
        if (first==last) {
            Answer newans;
            newans.num=num;
            newans.level=level;
            ans.push_back(newans);
            num=0;
            level++;
            if (!q.empty()) {
                first=q.front();
                last=q.back();//重新开始计数
            }
        }
    }
}
int main(){
    int root;
    //freopen("/Users/pantingting/Documents/code/data/input", "r", stdin);
    scanf("%d%lf%lf",&n,&p,&r);
    int index;
    for (int i=0; i<n; i++) {
        scanf("%d",&index);
        if (index==-1) {
            root=i;
        }
        else
            vec[index].push_back(i);//建立邻接链表
    }
    //BFS
    q.push(root);
    level=0;
    first=q.front();
    last=q.back();
    BFS();
    double price=p*pow((1+r/100.0),ans[ans.size()-1].level);
    printf("%.2lf %d\n",price,ans[ans.size()-1].num);
    return 0;
}

附上另一种同学的简洁做法

#include <iostream>
#include <string.h>
#include <math.h>
#include <iomanip>
using namespace std;

int level[100001];
int father[100001];
int getlevel(int i)
{
    if(father[i]==-1)
    {
        level[i]=1;
        return 1;
    }
    int &ans=level[i];
    if(ans)return ans;
    ans=getlevel(father[i])+1;
    return ans;
}
int main()
{
    int N;
    double price,rate;
    cin>>N>>price>>rate;
    int i=0;
    while(i<N)cin>>father[i++];
    memset(level,0,sizeof(level));
    int max_level=0;
    int cnt=0;
    for(int i=0;i<N;i++)
    {
        level[i]=getlevel(i);
        if(max_level<level[i])
        {
            max_level=level[i];
            cnt=1;
        }
        else if(max_level==level[i])cnt++;
    }
    double max_price=price*pow(1+rate/100,max_level-1);
    cout<<setiosflags(ios::fixed)<<setprecision(2)<<max_price<<" "<<cnt<<endl;
    return 0;
}