<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/" id="article-nav-newer" class="article-nav-link-wrap">

<strong class="article-nav-caption">Newer</strong>

<div class="article-nav-title">

1094 The Largest Generation (25分)

</div>

</a>

<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>

<li>

<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/">1094 The Largest Generation (25分)</a>

</li>

<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>

<li>

<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/">1094 The Largest Generation (25分)</a>

</li>

<meta charset="utf-8">

<title>1094 The Largest Generation (25分) | Hexo</title>

<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">

<meta name="description" content="树的遍历题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。 DFS遍历，记录每层的宽度，找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include &lt;bits&#x2F;stdc++.h&gt;using namespace">

<meta property="og:type" content="article">

<meta property="og:title" content="1094 The Largest Generation (25分)">

<meta property="og:url" content="http://yoursite.com/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/index.html">

<meta property="og:site_name" content="Hexo">

<meta property="og:description" content="树的遍历题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。 DFS遍历，记录每层的宽度，找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include &lt;bits&#x2F;stdc++.h&gt;using namespace">

<meta property="og:locale" content="en_US">

<meta property="article:published_time" content="2020-03-02T03:50:29.787Z">

<meta property="article:modified_time" content="2020-03-02T03:50:29.787Z">

<meta property="article:author" content="John Doe">

<meta name="twitter:card" content="summary">

<link rel="alternate" href="/atom.xml" title="Hexo" type="application/atom+xml">

<link rel="icon" href="/favicon.png">

<link href="//fonts.googleapis.com/css?family=Source+Code+Pro" rel="stylesheet" type="text/css">

<link rel="stylesheet" href="/css/style.css">

<meta name="generator" content="Hexo 4.2.0"></head>

<div id="container">

<div id="wrap">

<header id="header">

<div id="banner"></div>

<div id="header-outer" class="outer">

<div id="header-title" class="inner">

<h1 id="logo-wrap">

<a href="/" id="logo">Hexo</a>

</h1>

</div>

<div id="header-inner" class="inner">

<nav id="main-nav">

<a id="main-nav-toggle" class="nav-icon"></a>

<a class="main-nav-link" href="/">Home</a>

<a class="main-nav-link" href="/archives">Archives</a>

</nav>

<nav id="sub-nav">

<a id="nav-rss-link" class="nav-icon" href="/atom.xml" title="RSS Feed"></a>

<a id="nav-search-btn" class="nav-icon" title="Search"></a>

</nav>

<div id="search-form-wrap">

<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">&#xF002;</button><input type="hidden" name="sitesearch" value="http://yoursite.com"></form>

</div>

</div>

</div>

<div class="outer">

<section id="main"><article id="post-1094 The Largest Generation (25分)" class="article article-type-post" itemscope itemprop="blogPost">

<div class="article-meta">

<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/" class="article-date">

<time datetime="2020-03-02T03:50:29.787Z" itemprop="datePublished">2020-03-02</time>

</div>

<div class="article-inner">

<header class="article-header">

<h1 class="article-title" itemprop="name">

1094 The Largest Generation (25分)

</h1>

</header>

<div class="article-entry" itemprop="articleBody">

<p>树的遍历<br><br>题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。</p>

<p>DFS遍历，记录每层的宽度，找最大的那个即可<br><br>也可以用BFS做</p>

<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 &lt;bits&#x2F;stdc++.h&gt;</span><br><span class="line">using namespace std;</span><br><span class="line">const int maxn &#x3D; 100 + 10;</span><br><span class="line"></span><br><span class="line">vector&lt;int&gt; 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) &#123;</span><br><span class="line"> level[cnt]++;</span><br><span class="line"> for (int i &#x3D; 0; i &lt; tree[root].size(); ++i)</span><br><span class="line"> DFS(tree[root][i], cnt + 1);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line">int main(int argc, char const *argv[])</span><br><span class="line">&#123;</span><br><span class="line"> int N, M, j &#x3D; 1, cnt &#x3D; 0, ans, root;</span><br><span class="line"> cin &gt;&gt; N &gt;&gt; M;</span><br><span class="line"> memset(vis, false, sizeof(vis));</span><br><span class="line"> for (int i &#x3D; 0; i &lt; M; ++i) &#123;</span><br><span class="line"> int ID, K, t;</span><br><span class="line"> cin &gt;&gt; ID &gt;&gt; K;</span><br><span class="line"> for (int j &#x3D; 0; j &lt; K; ++j) &#123;</span><br><span class="line"> cin &gt;&gt; t;</span><br><span class="line"> tree[ID].push_back(t);</span><br><span class="line"> vis[t] &#x3D; true;</span><br><span class="line"> &#125;</span><br><span class="line"> &#125;</span><br><span class="line"> for (int i &#x3D; 1; i &lt;&#x3D; N; ++i) &#123;</span><br><span class="line"> if (!vis[i]) &#123;</span><br><span class="line"> root &#x3D; i;</span><br><span class="line"> break;</span><br><span class="line"> &#125;</span><br><span class="line"> &#125;</span><br><span class="line"> DFS(root, 1);</span><br><span class="line"> while (level[j] !&#x3D; 0) &#123;</span><br><span class="line"> if (level[j] &gt; cnt) &#123;</span><br><span class="line"> ans &#x3D; j;</span><br><span class="line"> cnt &#x3D; level[j];</span><br><span class="line"> &#125;</span><br><span class="line"> j++;</span><br><span class="line"> &#125;</span><br><span class="line"> cout &lt;&lt; cnt &lt;&lt; &quot; &quot; &lt;&lt; ans &lt;&lt; endl;</span><br><span class="line"></span><br><span class="line"> return 0;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

</div>

<footer class="article-footer">

<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>

</footer>

</div>

<nav id="article-nav">

<a href="/2020/01/22/My-First-Post/" id="article-nav-older" class="article-nav-link-wrap">

<strong class="article-nav-caption">Older</strong>

<div class="article-nav-title">My First Post</div>

</a>

<aside id="sidebar">

<div class="widget-wrap">

<h3 class="widget-title">Archives</h3>

<div class="widget">

<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>

</div>

</div>

<div class="widget-wrap">

<h3 class="widget-title">Recent Posts</h3>

<div class="widget">

<ul>

<li>

<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/">1094 The Largest Generation (25分)</a>

</li>

<li>

<a href="/2020/01/22/My-First-Post/">My First Post</a>

</li>

<li>

<a href="/2020/01/22/hello-world/">Hello World</a>

</li>

</ul>

</div>

</div>

</div>

<footer id="footer">

<div class="outer">

<div id="footer-info" class="inner">

&copy; 2020 John Doe<br>

Powered by <a href="http://hexo.io/" target="_blank">Hexo</a>

</div>

</div>

</div>

<nav id="mobile-nav">

<a href="/" class="mobile-nav-link">Home</a>

<a href="/archives" class="mobile-nav-link">Archives</a>

<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.3/jquery.min.js"></script>

<link rel="stylesheet" href="/fancybox/jquery.fancybox.css">

<script src="/fancybox/jquery.fancybox.pack.js"></script>

<script src="/js/script.js"></script>

</div>

<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>

<li>

<a href="/2020/03/02/1094%20The%20Largest%20Generation%20(25%E5%88%86)/">1094 The Largest Generation (25分)</a>

</li>