Site updated: 2020-03-05 11:44:30

Author: tony-coder

Diff for: 2020/03/02/1094 The Largest Generation (25分)/index.html

@@ -7,15 +7,15 @@
 
   <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 name="description" content="树的遍历题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。 DFS遍历，记录每层的宽度，找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include &lt;bits&#x2F;stdc++.h&gt;using namespace std;c">
 <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:description" content="树的遍历题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。 DFS遍历，记录每层的宽度，找最大的那个即可也可以用BFS做 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include &lt;bits&#x2F;stdc++.h&gt;using namespace std;c">
 <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:modified_time" content="2020-03-05T03:44:07.840Z">
 <meta property="article:author" content="John Doe">
 <meta name="twitter:card" content="summary">
 
@@ -90,7 +90,7 @@ <h1 class="article-title" itemprop="name">
 
         <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>
+<figure class="highlight c++"><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"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string">&lt;bits/stdc++.h&gt;</span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> maxn = <span class="number">100</span> + <span class="number">10</span>;</span><br><span class="line"></span><br><span class="line"><span class="built_in">vector</span>&lt;<span class="keyword">int</span>&gt; tree[maxn];</span><br><span class="line"><span class="keyword">int</span> level[maxn];</span><br><span class="line"><span class="keyword">bool</span> vis[maxn];</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">DFS</span><span class="params">(<span class="keyword">int</span> root, <span class="keyword">int</span> cnt)</span> </span>&#123;</span><br><span class="line">	level[cnt]++;</span><br><span class="line">	<span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i &lt; tree[root].<span class="built_in">size</span>(); ++i)</span><br><span class="line">		DFS(tree[root][i], cnt + <span class="number">1</span>);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">(<span class="keyword">int</span> argc, <span class="keyword">char</span> <span class="keyword">const</span> *argv[])</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">	<span class="keyword">int</span> N, M, j = <span class="number">1</span>, cnt = <span class="number">0</span>, ans, root;</span><br><span class="line">	<span class="built_in">cin</span> &gt;&gt; N &gt;&gt; M;</span><br><span class="line">	<span class="built_in">memset</span>(vis, <span class="literal">false</span>, <span class="keyword">sizeof</span>(vis));</span><br><span class="line">	<span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i &lt; M; ++i) &#123;</span><br><span class="line">		<span class="keyword">int</span> ID, K, t;</span><br><span class="line">		<span class="built_in">cin</span> &gt;&gt; ID &gt;&gt; K;</span><br><span class="line">		<span class="keyword">for</span> (<span class="keyword">int</span> j = <span class="number">0</span>; j &lt; K; ++j) &#123;</span><br><span class="line">			<span class="built_in">cin</span> &gt;&gt; t;</span><br><span class="line">			tree[ID].push_back(t);</span><br><span class="line">			vis[t] = <span class="literal">true</span>;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">1</span>; i &lt;= N; ++i) &#123;</span><br><span class="line">		<span class="keyword">if</span> (!vis[i]) &#123;</span><br><span class="line">			root = i;</span><br><span class="line">			<span class="keyword">break</span>;</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">	DFS(root, <span class="number">1</span>);</span><br><span class="line">	<span class="keyword">while</span> (level[j] != <span class="number">0</span>) &#123;</span><br><span class="line">		<span class="keyword">if</span> (level[j] &gt; cnt) &#123;</span><br><span class="line">			ans = j;</span><br><span class="line">			cnt = 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">	<span class="built_in">cout</span> &lt;&lt; cnt &lt;&lt; <span class="string">" "</span> &lt;&lt; ans &lt;&lt; <span class="built_in">endl</span>;</span><br><span class="line"></span><br><span class="line">	<span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
 
 
     </div>

Diff for: 2020/03/04/1064 Complete Binary Search Tree (30分)/index.html

@@ -16,7 +16,7 @@
 <meta property="og:locale" content="en_US">
 <meta property="og:image" content="https://i.loli.net/2020/03/04/X2rieZHWd7UNMEK.png">
 <meta property="article:published_time" content="2020-03-04T01:31:02.291Z">
-<meta property="article:modified_time" content="2020-03-04T01:31:02.373Z">
+<meta property="article:modified_time" content="2020-03-05T03:44:01.815Z">
 <meta property="article:author" content="John Doe">
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://i.loli.net/2020/03/04/X2rieZHWd7UNMEK.png">
@@ -98,7 +98,7 @@ <h1 class="article-title" itemprop="name">
 <p>利用完全二叉树建立结构，中序遍历填入元素</p>
 </blockquote>
 <p><img src="https://i.loli.net/2020/03/04/X2rieZHWd7UNMEK.png" alt="clipboard.png"></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></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; 1000 + 10;</span><br><span class="line"></span><br><span class="line">int a[maxn], ans[maxn], cnt, N, i;</span><br><span class="line">void in_order(int root) &#123;</span><br><span class="line">	if (root &gt; N)</span><br><span class="line">		return;</span><br><span class="line">	in_order(root * 2);</span><br><span class="line">	ans[root] &#x3D; a[cnt++];</span><br><span class="line">	in_order(root * 2 + 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">	cin &gt;&gt; N;</span><br><span class="line">	for (i &#x3D; 0; i &lt; N; ++i)</span><br><span class="line">		cin &gt;&gt; a[i];</span><br><span class="line">	sort(a, a + N);</span><br><span class="line">	cnt &#x3D; 0;</span><br><span class="line">	in_order(1);</span><br><span class="line">	for (i &#x3D; 1; i &lt;&#x3D; N - 1; ++i)</span><br><span class="line">		cout &lt;&lt; ans[i] &lt;&lt; &quot; &quot;;</span><br><span class="line">	cout &lt;&lt; ans[i] &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>
+<figure class="highlight c++"><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></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string">&lt;bits/stdc++.h&gt;</span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> maxn = <span class="number">1000</span> + <span class="number">10</span>;</span><br><span class="line"></span><br><span class="line"><span class="keyword">int</span> a[maxn], ans[maxn], cnt, N, i;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">in_order</span><span class="params">(<span class="keyword">int</span> root)</span> </span>&#123;</span><br><span class="line">	<span class="keyword">if</span> (root &gt; N)</span><br><span class="line">		<span class="keyword">return</span>;</span><br><span class="line">	in_order(root * <span class="number">2</span>);</span><br><span class="line">	ans[root] = a[cnt++];</span><br><span class="line">	in_order(root * <span class="number">2</span> + <span class="number">1</span>);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">(<span class="keyword">int</span> argc, <span class="keyword">char</span> <span class="keyword">const</span> *argv[])</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">	<span class="built_in">cin</span> &gt;&gt; N;</span><br><span class="line">	<span class="keyword">for</span> (i = <span class="number">0</span>; i &lt; N; ++i)</span><br><span class="line">		<span class="built_in">cin</span> &gt;&gt; a[i];</span><br><span class="line">	sort(a, a + N);</span><br><span class="line">	cnt = <span class="number">0</span>;</span><br><span class="line">	in_order(<span class="number">1</span>);</span><br><span class="line">	<span class="keyword">for</span> (i = <span class="number">1</span>; i &lt;= N - <span class="number">1</span>; ++i)</span><br><span class="line">		<span class="built_in">cout</span> &lt;&lt; ans[i] &lt;&lt; <span class="string">" "</span>;</span><br><span class="line">	<span class="built_in">cout</span> &lt;&lt; ans[i] &lt;&lt; <span class="built_in">endl</span>;</span><br><span class="line"></span><br><span class="line">	<span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
 
 
     </div>