1094. The Largest Generation (25) PAT甲级
2017-02-10 21:47
525 查看
传送门
#include<stdio.h> #include<vector> #include<queue> #define MAX_N 110 using namespace std; struct Node{ int level; vector<int> child; }node[MAX_N]; int gene[MAX_N]; int n; int m; void bfs(int root,int level){ node[root].level=1; //gene[level]++; queue<int> q; q.push(root); while(!q.empty()){ int p=q.front(); q.pop(); gene[node[p].level]++; for(int i=0;i<node[p].child.size();i++){ node[node[p].child[i]].level=node[p].level+1; q.push(node[p].child[i]); } } } int main(){ int id,k; int child; scanf("%d%d",&n,&m); for(int i=0;i<m;i++){ scanf("%d%d",&id,&k); for(int j=0;j<k;j++){ scanf("%d",&child); node[id].child.push_back(child); } } bfs(1,1); int maxLevel=0,max=0; for(int i=1;i<MAX_N;i++){ if(gene[i]>max){ max=gene[i]; maxLevel=i; } } printf("%d %d",max,maxLevel); }
相关文章推荐
- PAT - 甲级 - 1094. The Largest Generation (25)(树的遍历DFS)
- 1094. The Largest Generation (25)-PAT甲级真题(bfs,dfs,树的遍历)
- 浙江大学PAT_甲级_1094. The Largest Generation (25)
- PAT 甲级 1094. The Largest Generation (25)
- PAT甲级真题及训练集(25)--1094. The Largest Generation (25)
- PAT (Advanced Level) 1094. The Largest Generation (25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- pat-a 1094. The Largest Generation (25)
- PAT 1094. The Largest Generation (25)
- PAT甲级 The Largest Generation (25)
- PAT-A-1094. The Largest Generation (25)
- 1094. The Largest Generation (25)【二叉树】——PAT (Advanced Level) Practise
- PAT 1094. The Largest Generation (25)
- PAT (Advanced Level) 1094. The Largest Generation (25) 人数最多的一代,BFS
- PAT 1094. The Largest Generation (25)
- 【PAT】1094. The Largest Generation (25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- PAT 1094. The Largest Generation (25)
- PAT (Advanced Level) Practise - 1094. The Largest Generation (25)
- 【PAT】【Advanced Level】1094. The Largest Generation (25)