1004.Counting Leaves (30)
pat-al-1004
2017-02-03
深搜和廣搜都可以/** * pat-al-1004 * 2017-02-03 * Cpp version * dfs * Author: fengLian_s */#include<stdio.h>#include<vector>using namespace std;vector<int> v[101];//坑：不是圓括號，是[]int result[101], maxDepth = -1;void dfs(int id, int depth){ if(v[id].size() == 0) { result[depth]++; if(depth > maxDepth) maxDepth = depth; return; } for(int i = 0;i < v[id].size();i++) { dfs(v[id][i], depth+1); }}int main(){ freopen("in.txt", "r", stdin); int n, m; scanf("%d%d", &n, &m); for(int i = 0;i < m;i++) { int father, k, child; scanf("%d%d", &father, &k); for(int j = 0;j < k;j++) { scanf("%d", &child); v[father].push_back(child); } } dfs(1, 0); -FIN-新聞熱點
疑難解答
