Site updated: 2024-09-25 19:06:29

2024/09/24/Ofuro 1/index.html

@@ -29,7 +29,7 @@
 <meta property="og:description" content="题面 给定长度为 \(n\) 的序列 \(A\) 和 \(B\). 一次 \(k\)-区间轮换是指: 选择 \(A\) 中一个长度为 \(k\) 的子区间, 将区间内的数字进行轮换. 求最大的 \(k\le n\), 满足: 对 \(A\) 进行若干次 \(k\)-区间轮换后, 可以将 \(A\) 变为 \(B\). 若没有 \(k\) 满足条件, 输出 \(-1\). 数据范围 \[">
 <meta property="og:locale" content="zh_CN">
 <meta property="article:published_time" content="2024-09-24T14:17:33.000Z">
-<meta property="article:modified_time" content="2024-09-24T14:17:37.000Z">
+<meta property="article:modified_time" content="2024-09-25T11:02:06.000Z">
 <meta property="article:author" content="Sheauhaw Jang">
 <meta property="article:tag" content="构造">
 <meta property="article:tag" content="抽象代数">
@@ -457,7 +457,7 @@ <h3 id="补充证明">补充证明</h3>
     <div class="content">
 
 <span class="post-time">
-    最后更新时间：<time datetime="2024-09-24T14:17:37.000Z" itemprop="dateUpdated">2024-09-24 22:17:37</time>
+    最后更新时间：<time datetime="2024-09-25T11:02:06.000Z" itemprop="dateUpdated">2024-09-25 19:02:06</time>
 </span><br>
 
 
@@ -535,7 +535,14 @@ <h3 id="补充证明">补充证明</h3>
     </div>
 
 
-<nav class="post-nav flex-row flex-justify-between flex-row-reverse">
+<nav class="post-nav flex-row flex-justify-between">
+
+    <div class="waves-block waves-effect prev">
+      <a href="/2024/09/25/Ofuro%202/" id="post-prev" class="post-nav-link">
+        <div class="tips"><i class="icon icon-angle-left icon-lg icon-pr"></i> Prev</div>
+        <h4 class="title">お風呂の随想之二</h4>
+      </a>
+    </div>