1004 Counting Leaves（30分）

题目翻译：

给定家族的一个族谱树，求得每层叶结点的数量

题解思路：

dfs

代码：

#include<bits/stdc++.h>
using namespace std;
int N, M;
int ans_child[101]={0};
int real_level;
vector<int> v[101];
void dfs(int curID, int curlevel)
{
	if (v[curID].size())
	{
		for (auto i : v[curID])
			dfs(i, curlevel + 1);
	}
	else
		ans_child[curlevel]++;
	real_level = max(real_level,curlevel);
	return;
}
int main()
{
	cin >> N >> M;
	int t, k, p;
	for (int i = 0;i < M;i++)
	{
		cin >> t >> k;
		while (k--)
		{
			cin >> p;
			v[t].push_back(p);
		}
	}
	dfs(1, 1);
	for (int i = 1;i <= real_level;i++)
	{
		if (i != 1)
			cout << " ";
		cout << ans_child[i];
	}
}

坑点：

无

二刷：

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
vector<int> v[N];
int n, m;
int max_level;
int num_level[N];

void dfs(int cur_level, int cur_node) {
	if (v[cur_node].empty())
		num_level[cur_level]++;
	else {
		for (auto i : v[cur_node])
			dfs(cur_level + 1, i);
	}
	max_level = max(max_level, cur_level);
}

int main() {
	cin >> n >> m;
	for (int i = 0;i < m;i++) {
		int a, k;cin >> a >> k;
		while (k--) {
			int b;cin >> b;
			v[a].push_back(b);
		}
	}
	dfs(1, 1);
	for (int i = 1;i <= max_level;i++) {
		if (i != 1) cout << " ";
		cout << num_level[i];
	}
}