1094 The Largest Generation (25 分)（BFS）

#include <cstdio>
#include <vector>
#include<queue>
#include<algorithm>
using namespace std;
struct node
{
    int layer;
    vector<int>child;
}Node[110];
int n,m,level = 0;

void Bfs(int root)
{
    queue<int>q;
    q.push(root);

    while(!q.empty())
    {
        int s = q.front();
        q.pop();
        for(int i = 0;i<Node[s].child.size();i++)
        {
            int cid = Node[s].child[i];
            Node[cid].layer = Node[s].layer + 1;
            if(Node[cid].layer > level) level = Node[cid].layer;
            q.push(cid);
        }
    }
}

int main()
{
    // freopen("in.txt","r",stdin);
    scanf("%d%d",&n,&m);
    Node[1].layer = 1;
    for(int i = 1;i<=m;i++)
    {
        int fid,k;
        scanf("%d %d",&fid,&k);
        for(int j = 0;j<k;j++)
        {
            int t;
            scanf("%d",&t);
            Node[fid].child.push_back(t);
        }
    }
    Bfs(1);
    int pop[100] = {0};
    fill(pop,pop+100,0);
    int maxn = 1,large = 1;
    for(int i = 1;i<=n;i++)
    {
        int temp =  Node[i].layer;
        pop[temp]++;
    }
    for(int i = 1;i<=level;i++)
    {
        if(maxn < pop[i])
        {
             maxn = pop[i];
             large = i;
        }
    }
    printf("%d %d",maxn,large);

}