Site updated: 2020-03-16 22:39:06

archives/2020/03/index.html

@@ -176,7 +176,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/04/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -196,7 +196,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -216,7 +216,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -236,7 +236,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -256,7 +256,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -276,7 +276,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -296,7 +296,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -316,7 +316,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -336,7 +336,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

archives/2020/index.html

@@ -176,7 +176,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/04/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -196,7 +196,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -216,7 +216,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -236,7 +236,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -256,7 +256,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -276,7 +276,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -296,7 +296,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -316,7 +316,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -336,7 +336,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

archives/index.html

@@ -176,7 +176,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/04/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -196,7 +196,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -216,7 +216,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>
@@ -236,7 +236,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -256,7 +256,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -276,7 +276,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>
@@ -296,7 +296,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>
@@ -316,7 +316,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -336,7 +336,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

index.html

@@ -155,7 +155,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/plan/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/plan/">
 <script>
     (function(){
         if(''){
@@ -179,7 +179,7 @@
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/01/plan/" class="post-title-link" itemprop="url">plan</a>
+            <a href="/posts/2020/plan/" class="post-title-link" itemprop="url">plan</a>
         </h1>
 
         <div class="post-meta">
@@ -219,7 +219,7 @@
           <p>This page is locked.</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/01/plan/#more" rel="contents">
+              <a class="btn" href="/posts/2020/plan/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -243,7 +243,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/04/computer/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/computer/">
 <script>
     (function(){
         if(''){
@@ -267,7 +267,7 @@
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/04/computer/" class="post-title-link" itemprop="url">How do computers work?</a>
+            <a href="/posts/2020/computer/" class="post-title-link" itemprop="url">How do computers work?</a>
         </h1>
 
         <div class="post-meta">
@@ -303,7 +303,7 @@
           <p>This page is locked</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/04/computer/#more" rel="contents">
+              <a class="btn" href="/posts/2020/computer/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -327,7 +327,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/segment-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/segment-tree/">
 <script>
     (function(){
         if(''){
@@ -351,7 +351,7 @@
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/02/segment-tree/" class="post-title-link" itemprop="url">线段树</a>
+            <a href="/posts/2020/segment-tree/" class="post-title-link" itemprop="url">线段树</a>
         </h1>
 
         <div class="post-meta">
@@ -392,7 +392,7 @@
 所以我们就有一种专门解决大范围区间修改查询的数据结构：线段树。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/02/segment-tree/#more" rel="contents">
+              <a class="btn" href="/posts/2020/segment-tree/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -416,7 +416,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/ferbonacci/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/ferbonacci/">
 <script>
     (function(){
         if(''){
@@ -440,7 +440,7 @@
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/02/ferbonacci/" class="post-title-link" itemprop="url">斐波那契数列-O(1)</a>
+            <a href="/posts/2020/ferbonacci/" class="post-title-link" itemprop="url">斐波那契数列-O(1)</a>
         </h1>
 
         <div class="post-meta">
@@ -517,7 +517,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/dinic/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/dinic/">
 <script>
     (function(){
         if(''){
@@ -541,7 +541,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/02/dinic/" class="post-title-link" itemprop="url">网络最大流-Dinic</a>
+            <a href="/posts/2020/dinic/" class="post-title-link" itemprop="url">网络最大流-Dinic</a>
         </h1>
 
         <div class="post-meta">
@@ -582,7 +582,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
 点之间有一些管子，这些管子都有单位时间内的容量，现在毒瘤水管工想知道，他的管子在<strong>单位时间内</strong>在起点终点之间最多能流多少水。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/02/dinic/#more" rel="contents">
+              <a class="btn" href="/posts/2020/dinic/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -606,7 +606,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/min-span-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/min-span-tree/">
 <script>
     (function(){
         if(''){
@@ -630,7 +630,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/01/min-span-tree/" class="post-title-link" itemprop="url">最小生成树</a>
+            <a href="/posts/2020/min-span-tree/" class="post-title-link" itemprop="url">最小生成树</a>
         </h1>
 
         <div class="post-meta">
@@ -671,7 +671,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
 最小生成树，就是找到一种生成树，使得这个生成树的边权和最小。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/01/min-span-tree/#more" rel="contents">
+              <a class="btn" href="/posts/2020/min-span-tree/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -695,7 +695,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/union-find/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/union-find/">
 <script>
     (function(){
         if(''){
@@ -719,7 +719,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/01/union-find/" class="post-title-link" itemprop="url">并查集</a>
+            <a href="/posts/2020/union-find/" class="post-title-link" itemprop="url">并查集</a>
         </h1>
 
         <div class="post-meta">
@@ -758,7 +758,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
 <p>并查集是一种快到爆炸的集合算法，可以进行两项基本操作：合并两个集合（并）、查询两个参数是否在一个集合内（查）。这也是它名字的由来。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/01/union-find/#more" rel="contents">
+              <a class="btn" href="/posts/2020/union-find/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -782,7 +782,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/tree-link/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/tree-link/">
 <script>
     (function(){
         if(''){
@@ -806,7 +806,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/01/tree-link/" class="post-title-link" itemprop="url">树链剖分</a>
+            <a href="/posts/2020/tree-link/" class="post-title-link" itemprop="url">树链剖分</a>
         </h1>
 
         <div class="post-meta">
@@ -847,7 +847,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
 <p>树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>l</mi><mi>o</mi><mi>g</mi><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(log n)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathdefault" style="margin-right:0.01968em;">l</span><span class="mord mathdefault">o</span><span class="mord mathdefault" style="margin-right:0.03588em;">g</span><span class="mord mathdefault">n</span><span class="mclose">)</span></span></span></span>。</p>
           <!--noindex-->
             <div class="post-button">
-              <a class="btn" href="/2020/03/01/tree-link/#more" rel="contents">
+              <a class="btn" href="/posts/2020/tree-link/#more" rel="contents">
                 Read more &raquo;
               </a>
             </div>
@@ -871,7 +871,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block home" lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/test/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/test/">
 <script>
     (function(){
         if(''){
@@ -895,7 +895,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
       <header class="post-header">
         <h1 class="post-title" itemprop="name headline">
           
-            <a href="/2020/03/01/test/" class="post-title-link" itemprop="url">test</a>
+            <a href="/posts/2020/test/" class="post-title-link" itemprop="url">test</a>
         </h1>
 
         <div class="post-meta">

2020/03/04/computer/index.html → posts/2020/computer/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="This page is locked">
 <meta property="og:type" content="article">
 <meta property="og:title" content="How do computers work?">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/04/computer/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/computer/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="This page is locked">
 <meta property="og:locale" content="en_US">
@@ -39,7 +39,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://schtonn.github.io/images/transistor.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/04/computer/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/computer/">
 
 
 <script id="page-configurations">
@@ -162,7 +162,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/04/computer/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/computer/">
 <script>
     (function(){
         if('x14'){
@@ -308,7 +308,7 @@ your browser does not support the video tag<br />
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/04/computer/" title="How do computers work?">https://schtonn.github.io/2020/03/04/computer/</a>
+    <a href="https://schtonn.github.io/posts/2020/computer/" title="How do computers work?">https://schtonn.github.io/posts/2020/computer/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -329,7 +329,7 @@ your browser does not support the video tag<br />
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/02/segment-tree/" rel="prev" title="线段树">
+    <a href="/posts/2020/segment-tree/" rel="prev" title="线段树">
       <i class="fa fa-chevron-left"></i> 线段树
     </a></div>
       <div class="post-nav-item"></div>
@@ -527,7 +527,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : 'd38850401becfdbfa2b4dbb86c9165cd',
+      id          : '4ac90dbb92dce2ad2c6ecde77488afc1',
         language: '',
       distractionFreeMode: true
     });

2020/03/02/dinic/index.html → posts/2020/dinic/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 存图方式（邻接表，邻接矩阵）,图的遍历（dfs，bfs）  引入 我们举个例子吧： 有一个毒瘤水管工，他会造水管，有一天他造了一个水管网络，就像一个图。其中有一个点只有出边，就是起点，还有一个点只有入边，是终点。 点之间有一些管子，这些管子都有单位时间内的容量，现在毒瘤水管工想知道，他的管子在单位时间内在起点终点之间最多能流多少水。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="网络最大流-Dinic">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/02/dinic/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/dinic/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 存图方式（邻接表，邻接矩阵）,图的遍历（dfs，bfs）  引入 我们举个例子吧： 有一个毒瘤水管工，他会造水管，有一天他造了一个水管网络，就像一个图。其中有一个点只有出边，就是起点，还有一个点只有入边，是终点。 点之间有一些管子，这些管子都有单位时间内的容量，现在毒瘤水管工想知道，他的管子在单位时间内在起点终点之间最多能流多少水。">
 <meta property="og:locale" content="en_US">
@@ -39,7 +39,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200111112801923.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/02/dinic/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/dinic/">
 
 
 <script id="page-configurations">
@@ -162,7 +162,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/dinic/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/dinic/">
 <script>
     (function(){
         if(''){
@@ -279,7 +279,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/02/dinic/" title="网络最大流-Dinic">https://schtonn.github.io/2020/03/02/dinic/</a>
+    <a href="https://schtonn.github.io/posts/2020/dinic/" title="网络最大流-Dinic">https://schtonn.github.io/posts/2020/dinic/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -300,11 +300,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/01/min-span-tree/" rel="prev" title="最小生成树">
+    <a href="/posts/2020/min-span-tree/" rel="prev" title="最小生成树">
       <i class="fa fa-chevron-left"></i> 最小生成树
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/02/ferbonacci/" rel="next" title="斐波那契数列-O(1)">
+    <a href="/posts/2020/ferbonacci/" rel="next" title="斐波那契数列-O(1)">
       斐波那契数列-O(1) <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -501,7 +501,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '9f2101699af787eb16ab719306674ce2',
+      id          : '2286a308b4f8767835393f5a7e7996ef',
         language: '',
       distractionFreeMode: true
     });

2020/03/02/ferbonacci/index.html → posts/2020/ferbonacci/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="引自：《信息学奥赛之-数学一本通》 揍是这样： F⁡(n)&#x3D;55⋅[(1+5)n−(1−5)n]\operatorname{F}(n)&#x3D;\dfrac{\sqrt{5}}{5}\cdot\left[\left(1+\sqrt{5}\right)^n-\left(1-\sqrt{5}\right)^n\right] F(n)&#x3D;55​​⋅[(1+5​)n−(1−5​)n] 代码揍这么简单： 123int">
 <meta property="og:type" content="article">
 <meta property="og:title" content="斐波那契数列-O(1)">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/02/ferbonacci/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/ferbonacci/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="引自：《信息学奥赛之-数学一本通》 揍是这样： F⁡(n)&#x3D;55⋅[(1+5)n−(1−5)n]\operatorname{F}(n)&#x3D;\dfrac{\sqrt{5}}{5}\cdot\left[\left(1+\sqrt{5}\right)^n-\left(1-\sqrt{5}\right)^n\right] F(n)&#x3D;55​​⋅[(1+5​)n−(1−5​)n] 代码揍这么简单： 123int">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="math">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/02/ferbonacci/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/ferbonacci/">
 
 
 <script id="page-configurations">
@@ -158,7 +158,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/ferbonacci/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/ferbonacci/">
 <script>
     (function(){
         if(''){
@@ -254,7 +254,7 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/02/ferbonacci/" title="斐波那契数列-O(1)">https://schtonn.github.io/2020/03/02/ferbonacci/</a>
+    <a href="https://schtonn.github.io/posts/2020/ferbonacci/" title="斐波那契数列-O(1)">https://schtonn.github.io/posts/2020/ferbonacci/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -275,11 +275,11 @@ s-65,47,-65,47z M834 80H400000v40H845z'/></svg></span></span></span><span class=
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/02/dinic/" rel="prev" title="网络最大流-Dinic">
+    <a href="/posts/2020/dinic/" rel="prev" title="网络最大流-Dinic">
       <i class="fa fa-chevron-left"></i> 网络最大流-Dinic
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/02/segment-tree/" rel="next" title="线段树">
+    <a href="/posts/2020/segment-tree/" rel="next" title="线段树">
       线段树 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -475,7 +475,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '57cf3853d14de8f8773454caf5760d5d',
+      id          : '3414e89dae367a6c3b5dc272575da07e',
         language: '',
       distractionFreeMode: true
     });

2020/03/01/min-span-tree/index.html → posts/2020/min-span-tree/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 存图方式（邻接表，邻接矩阵），并查集。 不会的快进入链接学习吧！  引入 生成树，就是从一个图中选中n−1n-1n−1条边，使得这些边构成一棵树，并包含图中的所有节点。 最小生成树，就是找到一种生成树，使得这个生成树的边权和最小。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="最小生成树">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/01/min-span-tree/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/min-span-tree/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 存图方式（邻接表，邻接矩阵），并查集。 不会的快进入链接学习吧！  引入 生成树，就是从一个图中选中n−1n-1n−1条边，使得这些边构成一棵树，并包含图中的所有节点。 最小生成树，就是找到一种生成树，使得这个生成树的边权和最小。">
 <meta property="og:locale" content="en_US">
@@ -48,7 +48,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200103203601629.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/01/min-span-tree/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/min-span-tree/">
 
 
 <script id="page-configurations">
@@ -171,7 +171,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/min-span-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/min-span-tree/">
 <script>
     (function(){
         if(''){
@@ -290,7 +290,7 @@ kruskal算法使用了一种极速闪电致命又自杀的东西：并查集。<
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/01/min-span-tree/" title="最小生成树">https://schtonn.github.io/2020/03/01/min-span-tree/</a>
+    <a href="https://schtonn.github.io/posts/2020/min-span-tree/" title="最小生成树">https://schtonn.github.io/posts/2020/min-span-tree/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -311,11 +311,11 @@ kruskal算法使用了一种极速闪电致命又自杀的东西：并查集。<
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/01/union-find/" rel="prev" title="并查集">
+    <a href="/posts/2020/union-find/" rel="prev" title="并查集">
       <i class="fa fa-chevron-left"></i> 并查集
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/02/dinic/" rel="next" title="网络最大流-Dinic">
+    <a href="/posts/2020/dinic/" rel="next" title="网络最大流-Dinic">
       网络最大流-Dinic <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -512,7 +512,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '4f85371b1ad4620222b739bd042ae9d9',
+      id          : 'f27fb130839f17b254db1d5fe5d1251f',
         language: '',
       distractionFreeMode: true
     });

2020/03/01/plan/index.html → posts/2020/plan/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="This page is locked.">
 <meta property="og:type" content="article">
 <meta property="og:title" content="plan">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/01/plan/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/plan/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="This page is locked.">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="other">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/01/plan/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/plan/">
 
 
 <script id="page-configurations">
@@ -158,7 +158,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/plan/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/plan/">
 <script>
     (function(){
         if('159375abc'){
@@ -336,7 +336,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/01/plan/" title="plan">https://schtonn.github.io/2020/03/01/plan/</a>
+    <a href="https://schtonn.github.io/posts/2020/plan/" title="plan">https://schtonn.github.io/posts/2020/plan/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -357,11 +357,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/01/test/" rel="prev" title="test">
+    <a href="/posts/2020/test/" rel="prev" title="test">
       <i class="fa fa-chevron-left"></i> test
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/01/tree-link/" rel="next" title="树链剖分">
+    <a href="/posts/2020/tree-link/" rel="next" title="树链剖分">
       树链剖分 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -558,7 +558,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '320feab227fe8c1cc8751f9449a59ceb',
+      id          : '7a704966436ff0e4f1a83e14303eecb3',
         language: '',
       distractionFreeMode: true
     });

2020/03/02/segment-tree/index.html → posts/2020/segment-tree/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 数组，结构体，二叉树  引入 有时候我们会遇到一些大规模的区间查找和区间修改问题，比如让你维护一个 10510^5105 长度的数列，要求操作有区间求和、区间加（区间每个数加上一个值），让你在一秒内完成 10510^5105 次操作。 暴力是肯定不行的，数据范围太大，操作太多，会超时。 所以我们就有一种专门解决大范围区间修改查询的数据结构：线段树。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="线段树">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/02/segment-tree/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/segment-tree/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 数组，结构体，二叉树  引入 有时候我们会遇到一些大规模的区间查找和区间修改问题，比如让你维护一个 10510^5105 长度的数列，要求操作有区间求和、区间加（区间每个数加上一个值），让你在一秒内完成 10510^5105 次操作。 暴力是肯定不行的，数据范围太大，操作太多，会超时。 所以我们就有一种专门解决大范围区间修改查询的数据结构：线段树。">
 <meta property="og:locale" content="en_US">
@@ -37,7 +37,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://schtonn.github.io/images/segment-1.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/02/segment-tree/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/segment-tree/">
 
 
 <script id="page-configurations">
@@ -160,7 +160,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/02/segment-tree/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/segment-tree/">
 <script>
     (function(){
         if(''){
@@ -272,7 +272,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/02/segment-tree/" title="线段树">https://schtonn.github.io/2020/03/02/segment-tree/</a>
+    <a href="https://schtonn.github.io/posts/2020/segment-tree/" title="线段树">https://schtonn.github.io/posts/2020/segment-tree/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -293,11 +293,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/02/ferbonacci/" rel="prev" title="斐波那契数列-O(1)">
+    <a href="/posts/2020/ferbonacci/" rel="prev" title="斐波那契数列-O(1)">
       <i class="fa fa-chevron-left"></i> 斐波那契数列-O(1)
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/04/computer/" rel="next" title="How do computers work?">
+    <a href="/posts/2020/computer/" rel="next" title="How do computers work?">
       How do computers work? <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -494,7 +494,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '53aba37a6e23b5dfaf3ebcf1ed252a07',
+      id          : 'e44de2e058530f707311a55b447820ce',
         language: '',
       distractionFreeMode: true
     });

2020/03/01/test/index.html → posts/2020/test/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="Is KaTeX working?-IT WORKED!NICE!\texttt{Is KaTeX working?-IT WORKED!NICE!}Is KaTeX working?-IT WORKED!NICE! aba^b ab (ab)\left(\dfrac{a}{b}\right) (ba​)">
 <meta property="og:type" content="article">
 <meta property="og:title" content="test">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/01/test/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/test/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="Is KaTeX working?-IT WORKED!NICE!\texttt{Is KaTeX working?-IT WORKED!NICE!}Is KaTeX working?-IT WORKED!NICE! aba^b ab (ab)\left(\dfrac{a}{b}\right) (ba​)">
 <meta property="og:locale" content="en_US">
@@ -35,7 +35,7 @@
 <meta property="article:tag" content="other">
 <meta name="twitter:card" content="summary">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/01/test/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/test/">
 
 
 <script id="page-configurations">
@@ -158,7 +158,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/test/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/test/">
 <script>
     (function(){
         if(''){
@@ -234,7 +234,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/01/test/" title="test">https://schtonn.github.io/2020/03/01/test/</a>
+    <a href="https://schtonn.github.io/posts/2020/test/" title="test">https://schtonn.github.io/posts/2020/test/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -256,7 +256,7 @@
     <div class="post-nav">
       <div class="post-nav-item"></div>
       <div class="post-nav-item">
-    <a href="/2020/03/01/plan/" rel="next" title="plan">
+    <a href="/posts/2020/plan/" rel="next" title="plan">
       plan <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -452,7 +452,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : '0f16415e8ac70baa541b149a05be9644',
+      id          : '694c0d2967fcf3b4c649e9f5ea87e3da',
         language: '',
       distractionFreeMode: true
     });

2020/03/01/tree-link/index.html → posts/2020/tree-link/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 必备：存图方式（邻接表，邻接矩阵），dfs序。 维护：线段树、树状数组、BST。 不会的快进入链接学习吧！  引入 树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="树链剖分">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/01/tree-link/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/tree-link/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 必备：存图方式（邻接表，邻接矩阵），dfs序。 维护：线段树、树状数组、BST。 不会的快进入链接学习吧！  引入 树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
 <meta property="og:locale" content="en_US">
@@ -37,7 +37,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20191228195815530.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/01/tree-link/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/tree-link/">
 
 
 <script id="page-configurations">
@@ -160,7 +160,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/tree-link/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/tree-link/">
 <script>
     (function(){
         if(''){
@@ -289,7 +289,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/01/tree-link/" title="树链剖分">https://schtonn.github.io/2020/03/01/tree-link/</a>
+    <a href="https://schtonn.github.io/posts/2020/tree-link/" title="树链剖分">https://schtonn.github.io/posts/2020/tree-link/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -310,11 +310,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/01/plan/" rel="prev" title="plan">
+    <a href="/posts/2020/plan/" rel="prev" title="plan">
       <i class="fa fa-chevron-left"></i> plan
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/01/union-find/" rel="next" title="并查集">
+    <a href="/posts/2020/union-find/" rel="next" title="并查集">
       并查集 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -511,7 +511,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : 'b33bcdbb95298204222aa9a946caea21',
+      id          : '6b847233592559414acd0fad0bd3a20f',
         language: '',
       distractionFreeMode: true
     });

2020/03/01/union-find/index.html → posts/2020/union-find/index.html

@@ -25,7 +25,7 @@
   <meta name="description" content="前置知识 哈哈，简单到爆，没有。  引入 并查集是一种快到爆炸的集合算法，可以进行两项基本操作：合并两个集合（并）、查询两个参数是否在一个集合内（查）。这也是它名字的由来。">
 <meta property="og:type" content="article">
 <meta property="og:title" content="并查集">
-<meta property="og:url" content="https://schtonn.github.io/2020/03/01/union-find/index.html">
+<meta property="og:url" content="https://schtonn.github.io/posts/2020/union-find/index.html">
 <meta property="og:site_name" content="Alex&#39;s Blog">
 <meta property="og:description" content="前置知识 哈哈，简单到爆，没有。  引入 并查集是一种快到爆炸的集合算法，可以进行两项基本操作：合并两个集合（并）、查询两个参数是否在一个集合内（查）。这也是它名字的由来。">
 <meta property="og:locale" content="en_US">
@@ -44,7 +44,7 @@
 <meta name="twitter:card" content="summary">
 <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20200105142700396.png">
 
-<link rel="canonical" href="https://schtonn.github.io/2020/03/01/union-find/">
+<link rel="canonical" href="https://schtonn.github.io/posts/2020/union-find/">
 
 
 <script id="page-configurations">
@@ -167,7 +167,7 @@
   
   
   <article itemscope itemtype="http://schema.org/Article" class="post-block " lang="en">
-    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/2020/03/01/union-find/">
+    <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/2020/union-find/">
 <script>
     (function(){
         if(''){
@@ -320,7 +320,7 @@
   </li>
   <li class="post-copyright-link">
     <strong>Post link: </strong>
-    <a href="https://schtonn.github.io/2020/03/01/union-find/" title="并查集">https://schtonn.github.io/2020/03/01/union-find/</a>
+    <a href="https://schtonn.github.io/posts/2020/union-find/" title="并查集">https://schtonn.github.io/posts/2020/union-find/</a>
   </li>
   <li class="post-copyright-license">
     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
@@ -341,11 +341,11 @@
         
     <div class="post-nav">
       <div class="post-nav-item">
-    <a href="/2020/03/01/tree-link/" rel="prev" title="树链剖分">
+    <a href="/posts/2020/tree-link/" rel="prev" title="树链剖分">
       <i class="fa fa-chevron-left"></i> 树链剖分
     </a></div>
       <div class="post-nav-item">
-    <a href="/2020/03/01/min-span-tree/" rel="next" title="最小生成树">
+    <a href="/posts/2020/min-span-tree/" rel="next" title="最小生成树">
       最小生成树 <i class="fa fa-chevron-right"></i>
     </a></div>
     </div>
@@ -542,7 +542,7 @@ NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
       repo        : 'schtonn.github.io',
       owner       : 'schtonn',
       admin       : ['schtonn'],
-      id          : 'db280b52dd9602fd3864502a0992dd72',
+      id          : 'ffebdda04a4b44f6a28ba177012a7080',
         language: '',
       distractionFreeMode: true
     });

tags/graph/index.html

@@ -178,7 +178,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/segment-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/segment-tree/" itemprop="url">
             <span itemprop="name">线段树</span>
           </a>
       </h2>
@@ -198,7 +198,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/dinic/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/dinic/" itemprop="url">
             <span itemprop="name">网络最大流-Dinic</span>
           </a>
       </h2>
@@ -218,7 +218,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/min-span-tree/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/min-span-tree/" itemprop="url">
             <span itemprop="name">最小生成树</span>
           </a>
       </h2>
@@ -238,7 +238,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/tree-link/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/tree-link/" itemprop="url">
             <span itemprop="name">树链剖分</span>
           </a>
       </h2>

tags/math/index.html

@@ -178,7 +178,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/02/ferbonacci/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/ferbonacci/" itemprop="url">
             <span itemprop="name">斐波那契数列-O(1)</span>
           </a>
       </h2>

tags/other/index.html

@@ -178,7 +178,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/04/computer/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/computer/" itemprop="url">
             <span itemprop="name">How do computers work?</span>
           </a>
       </h2>
@@ -198,7 +198,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/plan/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/plan/" itemprop="url">
             <span itemprop="name">plan</span>
           </a>
       </h2>
@@ -218,7 +218,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/test/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/test/" itemprop="url">
             <span itemprop="name">test</span>
           </a>
       </h2>

tags/struct/index.html

@@ -178,7 +178,7 @@
       </div>
 
       <h2 class="post-title">
-          <a class="post-title-link" href="/2020/03/01/union-find/" itemprop="url">
+          <a class="post-title-link" href="/posts/2020/union-find/" itemprop="url">
             <span itemprop="name">并查集</span>
           </a>
       </h2>