1
+ <!DOCTYPE html>
2
+ < html >
3
+ < head >
4
+ < meta charset ="utf-8 ">
5
+
6
+
7
+
8
+ < title > 1094 The Largest Generation (25分) | Hexo</ title >
9
+ < meta name ="viewport " content ="width=device-width, initial-scale=1, maximum-scale=1 ">
10
+ < meta name ="description " content ="树的遍历题意:给出谱系图(多叉树),求最多孩子的那一层的深度和宽度。 DFS遍历,记录每层的宽度,找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include <bits/stdc++.h>using namespace ">
11
+ < meta property ="og:type " content ="article ">
12
+ < meta property ="og:title " content ="1094 The Largest Generation (25分) ">
13
+ < meta property ="og:url " content ="http://yoursite.com/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/index.html ">
14
+ < meta property ="og:site_name " content ="Hexo ">
15
+ < meta property ="og:description " content ="树的遍历题意:给出谱系图(多叉树),求最多孩子的那一层的深度和宽度。 DFS遍历,记录每层的宽度,找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include <bits/stdc++.h>using namespace ">
16
+ < meta property ="og:locale " content ="en_US ">
17
+ < meta property ="article:published_time " content ="2020-03-02T03:50:29.787Z ">
18
+ < meta property ="article:modified_time " content ="2020-03-02T03:50:29.787Z ">
19
+ < meta property ="article:author " content ="John Doe ">
20
+ < meta name ="twitter:card " content ="summary ">
21
+
22
+ < link rel ="alternate " href ="/atom.xml " title ="Hexo " type ="application/atom+xml ">
23
+
24
+
25
+ < link rel ="icon " href ="/favicon.png ">
26
+
27
+
28
+ < link href ="//fonts.googleapis.com/css?family=Source+Code+Pro " rel ="stylesheet " type ="text/css ">
29
+
30
+
31
+ < link rel ="stylesheet " href ="/css/style.css ">
32
+
33
+ < meta name ="generator " content ="Hexo 4.2.0 "> </ head >
34
+
35
+ < body >
36
+ < div id ="container ">
37
+ < div id ="wrap ">
38
+ < header id ="header ">
39
+ < div id ="banner "> </ div >
40
+ < div id ="header-outer " class ="outer ">
41
+ < div id ="header-title " class ="inner ">
42
+ < h1 id ="logo-wrap ">
43
+ < a href ="/ " id ="logo "> Hexo</ a >
44
+ </ h1 >
45
+
46
+ </ div >
47
+ < div id ="header-inner " class ="inner ">
48
+ < nav id ="main-nav ">
49
+ < a id ="main-nav-toggle " class ="nav-icon "> </ a >
50
+
51
+ < a class ="main-nav-link " href ="/ "> Home</ a >
52
+
53
+ < a class ="main-nav-link " href ="/archives "> Archives</ a >
54
+
55
+ </ nav >
56
+ < nav id ="sub-nav ">
57
+
58
+ < a id ="nav-rss-link " class ="nav-icon " href ="/atom.xml " title ="RSS Feed "> </ a >
59
+
60
+ < a id ="nav-search-btn " class ="nav-icon " title ="Search "> </ a >
61
+ </ nav >
62
+ < div id ="search-form-wrap ">
63
+ < form action ="//google.com/search " method ="get " accept-charset ="UTF-8 " class ="search-form "> < input type ="search " name ="q " class ="search-form-input " placeholder ="Search "> < button type ="submit " class ="search-form-submit "> </ button > < input type ="hidden " name ="sitesearch " value ="http://yoursite.com "> </ form >
64
+ </ div >
65
+ </ div >
66
+ </ div >
67
+ </ header >
68
+ < div class ="outer ">
69
+ < section id ="main "> < article id ="post-1094 The Largest Generation (25分) " class ="article article-type-post " itemscope itemprop ="blogPost ">
70
+ < div class ="article-meta ">
71
+ < a href ="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/ " class ="article-date ">
72
+ < time datetime ="2020-03-02T03:50:29.787Z " itemprop ="datePublished "> 2020-03-02</ time >
73
+ </ a >
74
+
75
+ </ div >
76
+ < div class ="article-inner ">
77
+
78
+
79
+ < header class ="article-header ">
80
+
81
+
82
+ < h1 class ="article-title " itemprop ="name ">
83
+ 1094 The Largest Generation (25分)
84
+ </ h1 >
85
+
86
+
87
+ </ header >
88
+
89
+ < div class ="article-entry " itemprop ="articleBody ">
90
+
91
+ < p > 树的遍历< br > < br > 题意:给出谱系图(多叉树),求最多孩子的那一层的深度和宽度。</ p >
92
+ < p > DFS遍历,记录每层的宽度,找最大的那个即可< br > < br > 也可以用BFS做</ p >
93
+ < figure class ="highlight plain "> < table > < tr > < td class ="gutter "> < pre > < span class ="line "> 1</ span > < br > < span class ="line "> 2</ span > < br > < span class ="line "> 3</ span > < br > < span class ="line "> 4</ span > < br > < span class ="line "> 5</ span > < br > < span class ="line "> 6</ span > < br > < span class ="line "> 7</ span > < br > < span class ="line "> 8</ span > < br > < span class ="line "> 9</ span > < br > < span class ="line "> 10</ span > < br > < span class ="line "> 11</ span > < br > < span class ="line "> 12</ span > < br > < span class ="line "> 13</ span > < br > < span class ="line "> 14</ span > < br > < span class ="line "> 15</ span > < br > < span class ="line "> 16</ span > < br > < span class ="line "> 17</ span > < br > < span class ="line "> 18</ span > < br > < span class ="line "> 19</ span > < br > < span class ="line "> 20</ span > < br > < span class ="line "> 21</ span > < br > < span class ="line "> 22</ span > < br > < span class ="line "> 23</ span > < br > < span class ="line "> 24</ span > < br > < span class ="line "> 25</ span > < br > < span class ="line "> 26</ span > < br > < span class ="line "> 27</ span > < br > < span class ="line "> 28</ span > < br > < span class ="line "> 29</ span > < br > < span class ="line "> 30</ span > < br > < span class ="line "> 31</ span > < br > < span class ="line "> 32</ span > < br > < span class ="line "> 33</ span > < br > < span class ="line "> 34</ span > < br > < span class ="line "> 35</ span > < br > < span class ="line "> 36</ span > < br > < span class ="line "> 37</ span > < br > < span class ="line "> 38</ span > < br > < span class ="line "> 39</ span > < br > < span class ="line "> 40</ span > < br > < span class ="line "> 41</ span > < br > < span class ="line "> 42</ span > < br > < span class ="line "> 43</ span > < br > < span class ="line "> 44</ span > < br > < span class ="line "> 45</ span > < br > < span class ="line "> 46</ span > < br > </ pre > </ td > < td class ="code "> < pre > < span class ="line "> #include <bits/stdc++.h></ span > < br > < span class ="line "> using namespace std;</ span > < br > < span class ="line "> const int maxn = 100 + 10;</ span > < br > < span class ="line "> </ span > < br > < span class ="line "> vector<int> tree[maxn];</ span > < br > < span class ="line "> int level[maxn];</ span > < br > < span class ="line "> bool vis[maxn];</ span > < br > < span class ="line "> </ span > < br > < span class ="line "> void DFS(int root, int cnt) {</ span > < br > < span class ="line "> level[cnt]++;</ span > < br > < span class ="line "> for (int i = 0; i < tree[root].size(); ++i)</ span > < br > < span class ="line "> DFS(tree[root][i], cnt + 1);</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> </ span > < br > < span class ="line "> int main(int argc, char const *argv[])</ span > < br > < span class ="line "> {</ span > < br > < span class ="line "> int N, M, j = 1, cnt = 0, ans, root;</ span > < br > < span class ="line "> cin >> N >> M;</ span > < br > < span class ="line "> memset(vis, false, sizeof(vis));</ span > < br > < span class ="line "> for (int i = 0; i < M; ++i) {</ span > < br > < span class ="line "> int ID, K, t;</ span > < br > < span class ="line "> cin >> ID >> K;</ span > < br > < span class ="line "> for (int j = 0; j < K; ++j) {</ span > < br > < span class ="line "> cin >> t;</ span > < br > < span class ="line "> tree[ID].push_back(t);</ span > < br > < span class ="line "> vis[t] = true;</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> for (int i = 1; i <= N; ++i) {</ span > < br > < span class ="line "> if (!vis[i]) {</ span > < br > < span class ="line "> root = i;</ span > < br > < span class ="line "> break;</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> DFS(root, 1);</ span > < br > < span class ="line "> while (level[j] != 0) {</ span > < br > < span class ="line "> if (level[j] > cnt) {</ span > < br > < span class ="line "> ans = j;</ span > < br > < span class ="line "> cnt = level[j];</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> j++;</ span > < br > < span class ="line "> }</ span > < br > < span class ="line "> cout << cnt << " " << ans << endl;</ span > < br > < span class ="line "> </ span > < br > < span class ="line "> return 0;</ span > < br > < span class ="line "> }</ span > < br > </ pre > </ td > </ tr > </ table > </ figure >
94
+
95
+
96
+ </ div >
97
+ < footer class ="article-footer ">
98
+ < a data-url ="http://yoursite.com/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/ " data-id ="ck79xfg6v0000zouiarqn38vu " class ="article-share-link "> Share</ a >
99
+
100
+
101
+ </ footer >
102
+ </ div >
103
+
104
+
105
+ < nav id ="article-nav ">
106
+
107
+
108
+ < a href ="/2020/01/22/My-First-Post/ " id ="article-nav-older " class ="article-nav-link-wrap ">
109
+ < strong class ="article-nav-caption "> Older</ strong >
110
+ < div class ="article-nav-title "> My First Post</ div >
111
+ </ a >
112
+
113
+ </ nav >
114
+
115
+
116
+ </ article >
117
+
118
+ </ section >
119
+
120
+ < aside id ="sidebar ">
121
+
122
+
123
+
124
+
125
+
126
+
127
+
128
+
129
+
130
+
131
+ < div class ="widget-wrap ">
132
+ < h3 class ="widget-title "> Archives</ h3 >
133
+ < div class ="widget ">
134
+ < ul class ="archive-list "> < li class ="archive-list-item "> < a class ="archive-list-link " href ="/archives/2020/03/ "> March 2020</ a > </ li > < li class ="archive-list-item "> < a class ="archive-list-link " href ="/archives/2020/01/ "> January 2020</ a > </ li > </ ul >
135
+ </ div >
136
+ </ div >
137
+
138
+
139
+
140
+
141
+ < div class ="widget-wrap ">
142
+ < h3 class ="widget-title "> Recent Posts</ h3 >
143
+ < div class ="widget ">
144
+ < ul >
145
+
146
+ < li >
147
+ < a href ="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/ "> 1094 The Largest Generation (25分)</ a >
148
+ </ li >
149
+
150
+ < li >
151
+ < a href ="/2020/01/22/My-First-Post/ "> My First Post</ a >
152
+ </ li >
153
+
154
+ < li >
155
+ < a href ="/2020/01/22/hello-world/ "> Hello World</ a >
156
+ </ li >
157
+
158
+ </ ul >
159
+ </ div >
160
+ </ div >
161
+
162
+
163
+ </ aside >
164
+
165
+ </ div >
166
+ < footer id ="footer ">
167
+
168
+ < div class ="outer ">
169
+ < div id ="footer-info " class ="inner ">
170
+ © 2020 John Doe< br >
171
+ Powered by < a href ="http://hexo.io/ " target ="_blank "> Hexo</ a >
172
+ </ div >
173
+ </ div >
174
+ </ footer >
175
+ </ div >
176
+ < nav id ="mobile-nav ">
177
+
178
+ < a href ="/ " class ="mobile-nav-link "> Home</ a >
179
+
180
+ < a href ="/archives " class ="mobile-nav-link "> Archives</ a >
181
+
182
+ </ nav >
183
+
184
+
185
+ < script src ="//ajax.googleapis.com/ajax/libs/jquery/2.0.3/jquery.min.js "> </ script >
186
+
187
+
188
+
189
+ < link rel ="stylesheet " href ="/fancybox/jquery.fancybox.css ">
190
+
191
+
192
+ < script src ="/fancybox/jquery.fancybox.pack.js "> </ script >
193
+
194
+
195
+
196
+
197
+ < script src ="/js/script.js "> </ script >
198
+
199
+
200
+
201
+
202
+ </ div >
203
+ </ body >
204
+ </ html >
0 commit comments