题目链接
这道题完全是套路,自己想肯定是想不出来的,按照套路写,想都不要想。DFS套路如下:
#include <cstdio>
#include <vector>
using namespace std;
vector<int> child[110];
int hashTable[110]={0};
void DFS(int index, int level){
hashTable[level]++;
if (child[index].size()==0){
return;
}
for (int i=0; i<child[index].size(); i++){
DFS(child[index][i], level+1);
}
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
for (int i=0; i<m; i++){
int father,num;
scanf("%d %d",&father, &num);
for (int j=0; j<num; j++){
int temp;
scanf("%d",&temp);
child[father].push_back(temp);
}
}
DFS(1,1);
int maxL=0;
for (int i=0; i<110; i++){
if (hashTable[i]>hashTable[maxL]){
maxL=i;
}
}
printf("%d %d",hashTable[maxL],maxL);
}
几乎是模版套路,没啥创新。
BFS套路如下:
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
struct Node {
vector<int> child;
int level;
}node[100010];
int hashTable[100010]={0};
void BFS(int index, int level){
queue<int> q;
q.push(index);
node[index].level=level;
while (!q.empty()){
int now=q.front();
q.pop();
hashTable[node[now].level]++;
for (int i=0; i<node[now].child.size(); i++){
int child=node[now].child[i];
node[child].level=node[now].level+1;
q.push(child);
}
}
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
for (int i=0; i<m; i++){
int father,num;
scanf("%d %d",&father, &num);
for (int j=0; j<num; j++){
int temp;
scanf("%d",&temp);
node[father].child.push_back(temp);
}
}
BFS(1,1);
int maxL=0;
for (int i=0; i<110; i++){
if (hashTable[i]>hashTable[maxL]){
maxL=i;
}
}
printf("%d %d",hashTable[maxL],maxL);
}
BFS套路稍微有点绕,还是直接用DFS套路比较好。