diff --git a/obsidian/lib/metadata.json b/obsidian/lib/metadata.json
index 89a2afa..78a0dbc 100644
--- a/obsidian/lib/metadata.json
+++ b/obsidian/lib/metadata.json
@@ -1,6 +1,6 @@
 {
   "vaultName": "博客",
-  "lastExport": 1718615935755,
+  "lastExport": 1718618945587,
   "pluginVersion": "1.8.01",
   "validBodyClasses": "publish css-settings-manager theme-light show-inline-title show-ribbon",
   "useCustomHeadContent": false,
@@ -36,19 +36,6 @@
     "blog/2023-08-24-幻影坦克.md",
     "blog/2023-09-20-CSP-S-2023-复赛.md",
     "blog/2023-12-02-NOIP2023退役记.md",
-    "lib/media/cap.png",
-    "lib/media/flow.png",
-    "lib/media/res.png",
-    "lib/media/aug.png",
-    "lib/media/ffkill.png",
-    "lib/media/lvl.png",
-    "lib/media/bin.png",
-    "lib/media/binflow.png",
-    "lib/media/board.png",
-    "lib/media/boardnet.png",
-    "lib/media/inv.png",
-    "lib/media/1.jpeg",
-    "lib/media/2.jpeg",
     "lib/scripts/graph-wasm.wasm",
     "lib/fonts/94f2f163d4b698242fef.otf",
     "lib/fonts/72505e6a122c6acd5471.woff2",
@@ -99,7 +86,20 @@
     "lib/styles/obsidian.css",
     "lib/styles/other-plugins.css",
     "lib/styles/global-variable-styles.css",
-    "lib/styles/main-styles.css"
+    "lib/styles/main-styles.css",
+    "lib/media/cap.png",
+    "lib/media/flow.png",
+    "lib/media/res.png",
+    "lib/media/aug.png",
+    "lib/media/ffkill.png",
+    "lib/media/lvl.png",
+    "lib/media/bin.png",
+    "lib/media/binflow.png",
+    "lib/media/board.png",
+    "lib/media/boardnet.png",
+    "lib/media/inv.png",
+    "lib/media/1.jpeg",
+    "lib/media/2.jpeg"
   ],
   "mainDependencies": [
     "lib/scripts/graph-wasm.wasm",
@@ -431,307 +431,307 @@
       "dependencies": []
     },
     "lib/scripts/graph-wasm.wasm": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 23377,
       "exportedPath": "lib/scripts/graph-wasm.wasm",
       "dependencies": []
     },
     "lib/fonts/94f2f163d4b698242fef.otf": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 66800,
       "exportedPath": "lib/fonts/94f2f163d4b698242fef.otf",
       "dependencies": []
     },
     "lib/fonts/72505e6a122c6acd5471.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 104232,
       "exportedPath": "lib/fonts/72505e6a122c6acd5471.woff2",
       "dependencies": []
     },
     "lib/fonts/2d5198822ab091ce4305.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 104332,
       "exportedPath": "lib/fonts/2d5198822ab091ce4305.woff2",
       "dependencies": []
     },
     "lib/fonts/c8ba52b05a9ef10f4758.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 98868,
       "exportedPath": "lib/fonts/c8ba52b05a9ef10f4758.woff2",
       "dependencies": []
     },
     "lib/fonts/cb10ffd7684cd9836a05.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 106876,
       "exportedPath": "lib/fonts/cb10ffd7684cd9836a05.woff2",
       "dependencies": []
     },
     "lib/fonts/b5f0f109bc88052d4000.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 105804,
       "exportedPath": "lib/fonts/b5f0f109bc88052d4000.woff2",
       "dependencies": []
     },
     "lib/fonts/cbe0ae49c52c920fd563.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 106108,
       "exportedPath": "lib/fonts/cbe0ae49c52c920fd563.woff2",
       "dependencies": []
     },
     "lib/fonts/535a6cf662596b3bd6a6.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 111708,
       "exportedPath": "lib/fonts/535a6cf662596b3bd6a6.woff2",
       "dependencies": []
     },
     "lib/fonts/70cc7ff27245e82ad414.ttf": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 192740,
       "exportedPath": "lib/fonts/70cc7ff27245e82ad414.ttf",
       "dependencies": []
     },
     "lib/fonts/454577c22304619db035.ttf": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 161376,
       "exportedPath": "lib/fonts/454577c22304619db035.ttf",
       "dependencies": []
     },
     "lib/fonts/52ac8f3034507f1d9e53.ttf": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 191568,
       "exportedPath": "lib/fonts/52ac8f3034507f1d9e53.ttf",
       "dependencies": []
     },
     "lib/fonts/05b618077343fbbd92b7.ttf": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 155288,
       "exportedPath": "lib/fonts/05b618077343fbbd92b7.ttf",
       "dependencies": []
     },
     "lib/fonts/4bb6ac751d1c5478ff3a.woff2": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 7876,
       "exportedPath": "lib/fonts/4bb6ac751d1c5478ff3a.woff2",
       "dependencies": []
     },
     "lib/media/874d8b8e340f75575caa.svg": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 317,
       "exportedPath": "lib/media/874d8b8e340f75575caa.svg",
       "dependencies": []
     },
     "lib/fonts/mathjax_zero.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 1368,
       "exportedPath": "lib/fonts/mathjax_zero.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_main-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 34160,
       "exportedPath": "lib/fonts/mathjax_main-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_main-bold.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 34464,
       "exportedPath": "lib/fonts/mathjax_main-bold.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_math-italic.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 19360,
       "exportedPath": "lib/fonts/mathjax_math-italic.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_main-italic.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 20832,
       "exportedPath": "lib/fonts/mathjax_main-italic.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_math-bolditalic.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 19776,
       "exportedPath": "lib/fonts/mathjax_math-bolditalic.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_size1-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 5792,
       "exportedPath": "lib/fonts/mathjax_size1-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_size2-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 5464,
       "exportedPath": "lib/fonts/mathjax_size2-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_size3-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 3244,
       "exportedPath": "lib/fonts/mathjax_size3-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_size4-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 5148,
       "exportedPath": "lib/fonts/mathjax_size4-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_ams-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 40808,
       "exportedPath": "lib/fonts/mathjax_ams-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_calligraphic-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 9600,
       "exportedPath": "lib/fonts/mathjax_calligraphic-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_calligraphic-bold.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 9908,
       "exportedPath": "lib/fonts/mathjax_calligraphic-bold.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_fraktur-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 21480,
       "exportedPath": "lib/fonts/mathjax_fraktur-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_fraktur-bold.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 22340,
       "exportedPath": "lib/fonts/mathjax_fraktur-bold.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_sansserif-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 12660,
       "exportedPath": "lib/fonts/mathjax_sansserif-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_sansserif-bold.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 15944,
       "exportedPath": "lib/fonts/mathjax_sansserif-bold.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_sansserif-italic.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 14628,
       "exportedPath": "lib/fonts/mathjax_sansserif-italic.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_script-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 11852,
       "exportedPath": "lib/fonts/mathjax_script-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_typewriter-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 17604,
       "exportedPath": "lib/fonts/mathjax_typewriter-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_vector-regular.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 1136,
       "exportedPath": "lib/fonts/mathjax_vector-regular.woff",
       "dependencies": []
     },
     "lib/fonts/mathjax_vector-bold.woff": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 1116,
       "exportedPath": "lib/fonts/mathjax_vector-bold.woff",
       "dependencies": []
     },
     "lib/html/file-tree.html": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 23376,
       "exportedPath": "lib/html/file-tree.html",
       "dependencies": []
     },
     "lib/scripts/webpage.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 47290,
       "exportedPath": "lib/scripts/webpage.js",
       "dependencies": []
     },
     "lib/scripts/graph-view.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 15519,
       "exportedPath": "lib/scripts/graph-view.js",
       "dependencies": []
     },
     "lib/scripts/graph-wasm.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 14021,
       "exportedPath": "lib/scripts/graph-wasm.js",
       "dependencies": []
     },
     "lib/scripts/graph-render-worker.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 5179,
       "exportedPath": "lib/scripts/graph-render-worker.js",
       "dependencies": []
     },
     "lib/scripts/tinycolor.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 29832,
       "exportedPath": "lib/scripts/tinycolor.js",
       "dependencies": []
     },
     "lib/scripts/pixi.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 449509,
       "exportedPath": "lib/scripts/pixi.js",
       "dependencies": []
     },
     "lib/scripts/minisearch.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 29422,
       "exportedPath": "lib/scripts/minisearch.js",
       "dependencies": []
     },
     "lib/media/favicon.ico": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 15406,
       "exportedPath": "lib/media/favicon.ico",
       "dependencies": []
     },
     "lib/scripts/graph-data.js": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 2078,
       "exportedPath": "lib/scripts/graph-data.js",
       "dependencies": []
     },
     "lib/styles/obsidian.css": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 129920,
       "exportedPath": "lib/styles/obsidian.css",
       "dependencies": []
     },
     "lib/styles/other-plugins.css": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 2104,
       "exportedPath": "lib/styles/other-plugins.css",
       "dependencies": []
     },
     "lib/styles/global-variable-styles.css": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 419,
       "exportedPath": "lib/styles/global-variable-styles.css",
       "dependencies": []
     },
     "lib/styles/main-styles.css": {
-      "modifiedTime": 1718615935755,
+      "modifiedTime": 1718618945587,
       "sourceSize": 23130,
       "exportedPath": "lib/styles/main-styles.css",
       "dependencies": []
diff --git a/obsidian/lib/search-index.json b/obsidian/lib/search-index.json
index 4304209..e3695ed 100644
--- a/obsidian/lib/search-index.json
+++ b/obsidian/lib/search-index.json
@@ -1 +1 @@
-{"documentCount":95,"nextId":95,"documentIds":{"0":"blog/0000-00-00-目录.html","1":"blog/2022-11-22-线段树处理负数端点值.html","2":"blog/2022-11-22-整数数据范围和memset初值.html","3":"blog/2022-11-22-dijkstra最短路算法.html","4":"blog/2022-11-22-floyd和倍增floyd.html","5":"blog/2022-12-06-noip2022游寄.html","6":"blog/2022-12-15-洛谷p1654-osu.html","7":"blog/2022-12-20-osu拓展.html","8":"blog/2023-01-08-欧拉法的误差分析.html","9":"blog/2023-01-08-树状数组bit正确性的证明.html","10":"blog/2023-01-17-再看osu拓展.html","11":"blog/2023-02-05-latex和markdown冲突.html","12":"blog/2023-02-08-网络流入门.html","13":"blog/2023-02-10-konig定理和匈牙利算法(其实是增广路算法).html","14":"blog/2023-02-18-变质量系统中力与动量的关系.html","15":"blog/2023-02-20-云图床炸了.html","16":"blog/2023-02-23-毒瘤题,纪念一下.html","17":"blog/2023-03-04-快读模版.html","18":"blog/2023-03-10-vscode配置.html","19":"blog/2023-03-15-1维dp四边形不等式优化(决策单调性优化).html","20":"blog/2023-03-25-2维dp四边形不等式优化(决策单调性优化).html","21":"blog/2023-03-26-两道有意思的微积分题目.html","22":"blog/2023-04-14-wqs二分.html","23":"blog/2023-04-17-dev-c++翻新.html","24":"blog/2023-05-12-集合dp.html","25":"blog/2023-06-25-最小费用最大流.html","26":"blog/2023-07-17-不动点法求数列通项.html","27":"blog/2023-08-24-幻影坦克.html","28":"blog/2023-09-20-csp-s-2023-复赛.html","29":"blog/2023-12-02-noip2023退役记.html","30":"lib\\media\\cap.png","31":"lib\\media\\flow.png","32":"lib\\media\\res.png","33":"lib\\media\\aug.png","34":"lib\\media\\ffkill.png","35":"lib\\media\\lvl.png","36":"lib\\media\\bin.png","37":"lib\\media\\binflow.png","38":"lib\\media\\board.png","39":"lib\\media\\boardnet.png","40":"lib\\media\\inv.png","41":"lib\\media\\1.jpeg","42":"lib\\media\\2.jpeg","43":"lib\\scripts\\graph-wasm.wasm","44":"lib\\fonts\\94f2f163d4b698242fef.otf","45":"lib\\fonts\\72505e6a122c6acd5471.woff2","46":"lib\\fonts\\2d5198822ab091ce4305.woff2","47":"lib\\fonts\\c8ba52b05a9ef10f4758.woff2","48":"lib\\fonts\\cb10ffd7684cd9836a05.woff2","49":"lib\\fonts\\b5f0f109bc88052d4000.woff2","50":"lib\\fonts\\cbe0ae49c52c920fd563.woff2","51":"lib\\fonts\\535a6cf662596b3bd6a6.woff2","52":"lib\\fonts\\70cc7ff27245e82ad414.ttf","53":"lib\\fonts\\454577c22304619db035.ttf","54":"lib\\fonts\\52ac8f3034507f1d9e53.ttf","55":"lib\\fonts\\05b618077343fbbd92b7.ttf","56":"lib\\fonts\\4bb6ac751d1c5478ff3a.woff2","57":"lib\\media\\874d8b8e340f75575caa.svg","58":"lib\\fonts\\mathjax_zero.woff","59":"lib\\fonts\\mathjax_main-regular.woff","60":"lib\\fonts\\mathjax_main-bold.woff","61":"lib\\fonts\\mathjax_math-italic.woff","62":"lib\\fonts\\mathjax_main-italic.woff","63":"lib\\fonts\\mathjax_math-bolditalic.woff","64":"lib\\fonts\\mathjax_size1-regular.woff","65":"lib\\fonts\\mathjax_size2-regular.woff","66":"lib\\fonts\\mathjax_size3-regular.woff","67":"lib\\fonts\\mathjax_size4-regular.woff","68":"lib\\fonts\\mathjax_ams-regular.woff","69":"lib\\fonts\\mathjax_calligraphic-regular.woff","70":"lib\\fonts\\mathjax_calligraphic-bold.woff","71":"lib\\fonts\\mathjax_fraktur-regular.woff","72":"lib\\fonts\\mathjax_fraktur-bold.woff","73":"lib\\fonts\\mathjax_sansserif-regular.woff","74":"lib\\fonts\\mathjax_sansserif-bold.woff","75":"lib\\fonts\\mathjax_sansserif-italic.woff","76":"lib\\fonts\\mathjax_script-regular.woff","77":"lib\\fonts\\mathjax_typewriter-regular.woff","78":"lib\\fonts\\mathjax_vector-regular.woff","79":"lib\\fonts\\mathjax_vector-bold.woff","80":"lib\\html\\file-tree.html","81":"lib\\scripts\\webpage.js","82":"lib\\scripts\\graph-view.js","83":"lib\\scripts\\graph-wasm.js","84":"lib\\scripts\\graph-render-worker.js","85":"lib\\scripts\\tinycolor.js","86":"lib\\scripts\\pixi.js","87":"lib\\scripts\\minisearch.js","88":"lib\\media\\favicon.ico","89":"lib\\scripts\\graph-data.js","90":"lib\\styles\\obsidian.css","91":"lib\\styles\\other-plugins.css","92":"lib\\styles\\global-variable-styles.css","93":"lib\\styles\\main-styles.css","94":"lib\\metadata.json"},"fieldIds":{"path":0,"title":1,"content":2,"tags":3,"headers":4},"fieldLength":{"0":[5,3,4,1,3],"1":[6,4,19,1,4],"2":[6,4,22,1,7],"3":[6,4,125,1,13],"4":[6,4,86,1,8],"5":[6,4,31,1,13],"6":[7,5,24,1,9],"7":[6,4,73,1,6],"8":[6,4,26,1,4],"9":[6,4,45,1,20],"10":[6,4,22,1,6],"11":[6,4,11,1,4],"12":[6,4,351,1,51],"13":[7,6,163,1,12],"14":[6,4,28,1,7],"15":[6,4,17,1,4],"16":[7,5,157,1,5],"17":[6,4,82,1,4],"18":[6,4,27,1,5],"19":[7,6,82,1,6],"20":[7,6,72,1,6],"21":[6,4,11,1,6],"22":[6,4,54,1,9],"23":[7,5,85,1,9],"24":[6,4,38,1,4],"25":[6,4,62,1,4],"26":[6,4,64,1,8],"27":[6,4,25,1,4],"28":[8,6,152,1,11],"29":[6,4,97,1,7],"30":[4,1,1,1,1],"31":[4,1,1,1,1],"32":[4,1,1,1,1],"33":[4,1,1,1,1],"34":[4,1,1,1,1],"35":[4,1,1,1,1],"36":[4,1,1,1,1],"37":[4,1,1,1,1],"38":[4,1,1,1,1],"39":[4,1,1,1,1],"40":[4,1,1,1,1],"41":[4,1,1,1,1],"42":[4,1,1,1,1],"43":[4,2,1,1,1],"44":[4,1,1,1,1],"45":[4,1,1,1,1],"46":[4,1,1,1,1],"47":[4,1,1,1,1],"48":[4,1,1,1,1],"49":[4,1,1,1,1],"50":[4,1,1,1,1],"51":[4,1,1,1,1],"52":[4,1,1,1,1],"53":[4,1,1,1,1],"54":[4,1,1,1,1],"55":[4,1,1,1,1],"56":[4,1,1,1,1],"57":[4,1,1,1,1],"58":[5,2,1,1,1],"59":[6,3,1,1,1],"60":[6,3,1,1,1],"61":[6,3,1,1,1],"62":[6,3,1,1,1],"63":[6,3,1,1,1],"64":[6,3,1,1,1],"65":[6,3,1,1,1],"66":[6,3,1,1,1],"67":[6,3,1,1,1],"68":[6,3,1,1,1],"69":[6,3,1,1,1],"70":[6,3,1,1,1],"71":[6,3,1,1,1],"72":[6,3,1,1,1],"73":[6,3,1,1,1],"74":[6,3,1,1,1],"75":[6,3,1,1,1],"76":[6,3,1,1,1],"77":[6,3,1,1,1],"78":[6,3,1,1,1],"79":[6,3,1,1,1],"80":[4,2,1,1,1],"81":[4,1,1,1,1],"82":[5,2,1,1,1],"83":[5,2,1,1,1],"84":[6,3,1,1,1],"85":[4,1,1,1,1],"86":[4,1,1,1,1],"87":[4,1,1,1,1],"88":[4,1,1,1,1],"89":[5,2,1,1,1],"90":[4,1,1,1,1],"91":[5,2,1,1,1],"92":[5,3,1,1,1],"93":[4,2,1,1,1],"94":[3,1,1,1,1]},"averageFieldLength":[5.221052631578947,2.621052631578947,22.31578947368421,1,3.4105263157894736],"storedFields":{"0":{"path":"blog/0000-00-00-目录.html","title":"0000-00-00-目录","tags":[],"headers":["0000-00-00-目录"]},"1":{"path":"blog/2022-11-22-线段树处理负数端点值.html","title":"2022-11-22-线段树处理负数端点值","tags":[],"headers":["2022-11-22-线段树处理负数端点值"]},"2":{"path":"blog/2022-11-22-整数数据范围和memset初值.html","title":"2022-11-22-整数数据范围和memset初值","tags":[],"headers":["2022-11-22-整数数据范围和memset初值","整数数据范围","memset 初值"]},"3":{"path":"blog/2022-11-22-dijkstra最短路算法.html","title":"2022-11-22-Dijkstra最短路算法","tags":[],"headers":["2022-11-22-Dijkstra最短路算法","算法过程","适用范围","解释","对不同$f$的复杂度分析","暴力","堆","优先队列","结论","代码"]},"4":{"path":"blog/2022-11-22-floyd和倍增floyd.html","title":"2022-11-22-Floyd和倍增Floyd","tags":[],"headers":["2022-11-22-Floyd和倍增Floyd","1.Floyd","2.倍增Floyd"]},"5":{"path":"blog/2022-12-06-noip2022游寄.html","title":"2022-12-06-NOIP2022游寄","tags":[],"headers":["2022-12-06-NOIP2022游寄","T1 (25/100)","T2 (0/100)","T3 (0/100)","T4 (8/100)","总结"]},"6":{"path":"blog/2022-12-15-洛谷p1654-osu.html","title":"2022-12-15-洛谷P1654-OSU","tags":[],"headers":["2022-12-15-洛谷P1654-OSU","定义","分数的递推式","长度的递推式","期望值的递推式"]},"7":{"path":"blog/2022-12-20-osu拓展.html","title":"2022-12-20-OSU拓展","tags":[],"headers":["2022-12-20-OSU拓展","题面","解法"]},"8":{"path":"blog/2023-01-08-欧拉法的误差分析.html","title":"2023-01-08-欧拉法的误差分析","tags":[],"headers":["2023-01-08-欧拉法的误差分析"]},"9":{"path":"blog/2023-01-08-树状数组bit正确性的证明.html","title":"2023-01-08-树状数组BIT正确性的证明","tags":[],"headers":["2023-01-08-树状数组BIT正确性的证明","询问","更新","第一步：证明 $bit[p]$ 真包含于 $bit[p+LSB(p)]$","第二部：证明对任意满足 $p<i<p+LSB(p)$ 的 $i$ ， $bit[i]$ 不包含 $bit[p]$"]},"10":{"path":"blog/2023-01-17-再看osu拓展.html","title":"2023-01-17-再看OSU拓展","tags":[],"headers":["2023-01-17-再看OSU拓展","二项式定理做法","正解做法"]},"11":{"path":"blog/2023-02-05-latex和markdown冲突.html","title":"2023-02-05-latex和markdown冲突","tags":[],"headers":["2023-02-05-latex和markdown冲突"]},"12":{"path":"blog/2023-02-08-网络流入门.html","title":"2023-02-08-网络流入门","tags":[],"headers":["2023-02-08-网络流入门","什么是网络流","容量网络（capacity network）：加了容量的网络，上面每条边的权值等于这条边的容量","流量网络（flow network）：加了流量的网络，x/y表示流量/容量","残量网络（residual network）：$G$中所有结点和剩余容量大于 $0$ 的边和反向边构成的图，一般记作 $G_f$","最大流","算法","Ford-Fulkerson: 每次通过dfs找一条增广路径","Edmond-Karp~~动能算法~~: 每次通过bfs找一条增广路径","代码","Dinic: bfs+dfs每次尝试寻找多条增广路径","最小割","最大流最小割定理","应用","1. 二分图最大匹配","2. 对“二选一”类型的问题建模","例题","第一题","解法","第二题","解法","按照集合划分理解","按照割边来理解","常见结构"]},"13":{"path":"blog/2023-02-10-konig定理和匈牙利算法(其实是增广路算法).html","title":"2023-02-10-Konig定理和匈牙利算法(其实是增广路算法)","tags":[],"headers":["2023-02-10-Konig定理和匈牙利算法(其实是增广路算法)","Konig定理","证明：","匈牙利算法 (其实是增广路算法)","代码","Berge's theorem"]},"14":{"path":"blog/2023-02-18-变质量系统中力与动量的关系.html","title":"2023-02-18-变质量系统中力与动量的关系","tags":[],"headers":["2023-02-18-变质量系统中力与动量的关系","证明","例子：火箭方程"]},"15":{"path":"blog/2023-02-20-云图床炸了.html","title":"2023-02-20-云图床炸了","tags":[],"headers":["2023-02-20-云图床炸了"]},"16":{"path":"blog/2023-02-23-毒瘤题,纪念一下.html","title":"2023-02-23-毒瘤题,纪念一下","tags":[],"headers":["2023-02-23-毒瘤题,纪念一下"]},"17":{"path":"blog/2023-03-04-快读模版.html","title":"2023-03-04-快读模版","tags":[],"headers":["2023-03-04-快读模版"]},"18":{"path":"blog/2023-03-10-vscode配置.html","title":"2023-03-10-VSCode配置","tags":[],"headers":["2023-03-10-VSCode配置","推荐OI类和装饰性拓展"]},"19":{"path":"blog/2023-03-15-1维dp四边形不等式优化(决策单调性优化).html","title":"2023-03-15-1维DP四边形不等式优化(决策单调性优化)","tags":[],"headers":["2023-03-15-1维DP四边形不等式优化(决策单调性优化)"]},"20":{"path":"blog/2023-03-25-2维dp四边形不等式优化(决策单调性优化).html","title":"2023-03-25-2维DP四边形不等式优化(决策单调性优化)","tags":[],"headers":["2023-03-25-2维DP四边形不等式优化(决策单调性优化)"]},"21":{"path":"blog/2023-03-26-两道有意思的微积分题目.html","title":"2023-03-26-两道有意思的微积分题目","tags":[],"headers":["2023-03-26-两道有意思的微积分题目","第一题","第二题"]},"22":{"path":"blog/2023-04-14-wqs二分.html","title":"2023-04-14-wqs二分","tags":[],"headers":["2023-04-14-wqs二分","引入","Lagrange Sufficiency  Theorem:","经典题目"]},"23":{"path":"blog/2023-04-17-dev-c++翻新.html","title":"2023-04-17-Dev-C++翻新","tags":[],"headers":["2023-04-17-Dev-C++翻新","翻新编译器","让AStyle能工作","美化 Dev C++"]},"24":{"path":"blog/2023-05-12-集合dp.html","title":"2023-05-12-集合DP","tags":[],"headers":["2023-05-12-集合DP"]},"25":{"path":"blog/2023-06-25-最小费用最大流.html","title":"2023-06-25-最小费用最大流","tags":[],"headers":["2023-06-25-最小费用最大流"]},"26":{"path":"blog/2023-07-17-不动点法求数列通项.html","title":"2023-07-17-不动点法求数列通项","tags":[],"headers":["2023-07-17-不动点法求数列通项","1","2","3","参考资料"]},"27":{"path":"blog/2023-08-24-幻影坦克.html","title":"2023-08-24-幻影坦克","tags":[],"headers":["2023-08-24-幻影坦克"]},"28":{"path":"blog/2023-09-20-csp-s-2023-复赛.html","title":"2023-09-20-CSP-S-2023-复赛","tags":[],"headers":["2023-09-20-CSP-S-2023-复赛","T2","做法1：dp","做法2：哈希"]},"29":{"path":"blog/2023-12-02-noip2023退役记.html","title":"2023-12-02-NOIP2023退役记","tags":[],"headers":["2023-12-02-NOIP2023退役记","开考","后记","总结"]},"30":{"path":"lib\\media\\cap.png","title":"cap","tags":[],"headers":[]},"31":{"path":"lib\\media\\flow.png","title":"flow","tags":[],"headers":[]},"32":{"path":"lib\\media\\res.png","title":"res","tags":[],"headers":[]},"33":{"path":"lib\\media\\aug.png","title":"aug","tags":[],"headers":[]},"34":{"path":"lib\\media\\ffkill.png","title":"ffkill","tags":[],"headers":[]},"35":{"path":"lib\\media\\lvl.png","title":"lvl","tags":[],"headers":[]},"36":{"path":"lib\\media\\bin.png","title":"bin","tags":[],"headers":[]},"37":{"path":"lib\\media\\binflow.png","title":"binflow","tags":[],"headers":[]},"38":{"path":"lib\\media\\board.png","title":"board","tags":[],"headers":[]},"39":{"path":"lib\\media\\boardnet.png","title":"boardnet","tags":[],"headers":[]},"40":{"path":"lib\\media\\inv.png","title":"inv","tags":[],"headers":[]},"41":{"path":"lib\\media\\1.jpeg","title":"1","tags":[],"headers":[]},"42":{"path":"lib\\media\\2.jpeg","title":"2","tags":[],"headers":[]},"43":{"path":"lib\\scripts\\graph-wasm.wasm","title":"graph-wasm","tags":[],"headers":[]},"44":{"path":"lib\\fonts\\94f2f163d4b698242fef.otf","title":"94f2f163d4b698242fef","tags":[],"headers":[]},"45":{"path":"lib\\fonts\\72505e6a122c6acd5471.woff2","title":"72505e6a122c6acd5471","tags":[],"headers":[]},"46":{"path":"lib\\fonts\\2d5198822ab091ce4305.woff2","title":"2d5198822ab091ce4305","tags":[],"headers":[]},"47":{"path":"lib\\fonts\\c8ba52b05a9ef10f4758.woff2","title":"c8ba52b05a9ef10f4758","tags":[],"headers":[]},"48":{"path":"lib\\fonts\\cb10ffd7684cd9836a05.woff2","title":"cb10ffd7684cd9836a05","tags":[],"headers":[]},"49":{"path":"lib\\fonts\\b5f0f109bc88052d4000.woff2","title":"b5f0f109bc88052d4000","tags":[],"headers":[]},"50":{"path":"lib\\fonts\\cbe0ae49c52c920fd563.woff2","title":"cbe0ae49c52c920fd563","tags":[],"headers":[]},"51":{"path":"lib\\fonts\\535a6cf662596b3bd6a6.woff2","title":"535a6cf662596b3bd6a6","tags":[],"headers":[]},"52":{"path":"lib\\fonts\\70cc7ff27245e82ad414.ttf","title":"70cc7ff27245e82ad414","tags":[],"headers":[]},"53":{"path":"lib\\fonts\\454577c22304619db035.ttf","title":"454577c22304619db035","tags":[],"headers":[]},"54":{"path":"lib\\fonts\\52ac8f3034507f1d9e53.ttf","title":"52ac8f3034507f1d9e53","tags":[],"headers":[]},"55":{"path":"lib\\fonts\\05b618077343fbbd92b7.ttf","title":"05b618077343fbbd92b7","tags":[],"headers":[]},"56":{"path":"lib\\fonts\\4bb6ac751d1c5478ff3a.woff2","title":"4bb6ac751d1c5478ff3a","tags":[],"headers":[]},"57":{"path":"lib\\media\\874d8b8e340f75575caa.svg","title":"874d8b8e340f75575caa","tags":[],"headers":[]},"58":{"path":"lib\\fonts\\mathjax_zero.woff","title":"mathjax_zero","tags":[],"headers":[]},"59":{"path":"lib\\fonts\\mathjax_main-regular.woff","title":"mathjax_main-regular","tags":[],"headers":[]},"60":{"path":"lib\\fonts\\mathjax_main-bold.woff","title":"mathjax_main-bold","tags":[],"headers":[]},"61":{"path":"lib\\fonts\\mathjax_math-italic.woff","title":"mathjax_math-italic","tags":[],"headers":[]},"62":{"path":"lib\\fonts\\mathjax_main-italic.woff","title":"mathjax_main-italic","tags":[],"headers":[]},"63":{"path":"lib\\fonts\\mathjax_math-bolditalic.woff","title":"mathjax_math-bolditalic","tags":[],"headers":[]},"64":{"path":"lib\\fonts\\mathjax_size1-regular.woff","title":"mathjax_size1-regular","tags":[],"headers":[]},"65":{"path":"lib\\fonts\\mathjax_size2-regular.woff","title":"mathjax_size2-regular","tags":[],"headers":[]},"66":{"path":"lib\\fonts\\mathjax_size3-regular.woff","title":"mathjax_size3-regular","tags":[],"headers":[]},"67":{"path":"lib\\fonts\\mathjax_size4-regular.woff","title":"mathjax_size4-regular","tags":[],"headers":[]},"68":{"path":"lib\\fonts\\mathjax_ams-regular.woff","title":"mathjax_ams-regular","tags":[],"headers":[]},"69":{"path":"lib\\fonts\\mathjax_calligraphic-regular.woff","title":"mathjax_calligraphic-regular","tags":[],"headers":[]},"70":{"path":"lib\\fonts\\mathjax_calligraphic-bold.woff","title":"mathjax_calligraphic-bold","tags":[],"headers":[]},"71":{"path":"lib\\fonts\\mathjax_fraktur-regular.woff","title":"mathjax_fraktur-regular","tags":[],"headers":[]},"72":{"path":"lib\\fonts\\mathjax_fraktur-bold.woff","title":"mathjax_fraktur-bold","tags":[],"headers":[]},"73":{"path":"lib\\fonts\\mathjax_sansserif-regular.woff","title":"mathjax_sansserif-regular","tags":[],"headers":[]},"74":{"path":"lib\\fonts\\mathjax_sansserif-bold.woff","title":"mathjax_sansserif-bold","tags":[],"headers":[]},"75":{"path":"lib\\fonts\\mathjax_sansserif-italic.woff","title":"mathjax_sansserif-italic","tags":[],"headers":[]},"76":{"path":"lib\\fonts\\mathjax_script-regular.woff","title":"mathjax_script-regular","tags":[],"headers":[]},"77":{"path":"lib\\fonts\\mathjax_typewriter-regular.woff","title":"mathjax_typewriter-regular","tags":[],"headers":[]},"78":{"path":"lib\\fonts\\mathjax_vector-regular.woff","title":"mathjax_vector-regular","tags":[],"headers":[]},"79":{"path":"lib\\fonts\\mathjax_vector-bold.woff","title":"mathjax_vector-bold","tags":[],"headers":[]},"80":{"path":"lib\\html\\file-tree.html","title":"file-tree","tags":[],"headers":[]},"81":{"path":"lib\\scripts\\webpage.js","title":"webpage","tags":[],"headers":[]},"82":{"path":"lib\\scripts\\graph-view.js","title":"graph-view","tags":[],"headers":[]},"83":{"path":"lib\\scripts\\graph-wasm.js","title":"graph-wasm","tags":[],"headers":[]},"84":{"path":"lib\\scripts\\graph-render-worker.js","title":"graph-render-worker","tags":[],"headers":[]},"85":{"path":"lib\\scripts\\tinycolor.js","title":"tinycolor","tags":[],"headers":[]},"86":{"path":"lib\\scripts\\pixi.js","title":"pixi","tags":[],"headers":[]},"87":{"path":"lib\\scripts\\minisearch.js","title":"minisearch","tags":[],"headers":[]},"88":{"path":"lib\\media\\favicon.ico","title":"favicon","tags":[],"headers":[]},"89":{"path":"lib\\scripts\\graph-data.js","title":"graph-data","tags":[],"headers":[]},"90":{"path":"lib\\styles\\obsidian.css","title":"obsidian","tags":[],"headers":[]},"91":{"path":"lib\\styles\\other-plugins.css","title":"other-plugins","tags":[],"headers":[]},"92":{"path":"lib\\styles\\global-variable-styles.css","title":"global-variable-styles","tags":[],"headers":[]},"93":{"path":"lib\\styles\\main-styles.css","title":"main-styles","tags":[],"headers":[]},"94":{"path":"lib\\metadata.json","title":"metadata","tags":[],"headers":[]}},"dirtCount":0,"index":[["4bb6ac751d1c5478ff3a",{"0":{"56":1},"1":{"56":1}}],["454577c22304619db035",{"0":{"53":1},"1":{"53":1}}],["应该还是能干不少分的",{"2":{"29":1}}],["应用",{"2":{"12":1},"4":{"12":1}}],["调代码时间用得太多了",{"2":{"29":1}}],["调用之后没有效果",{"2":{"23":1}}],["还算不错",{"2":{"29":1}}],["还是很好想的",{"2":{"5":1}}],["感觉这次又要寄了",{"2":{"29":1}}],["看其他人游记",{"2":{"29":1}}],["看最后时间不多了",{"2":{"29":1}}],["过了所有样例",{"2":{"29":1}}],["过了大样例",{"2":{"29":1}}],["以及找出分量遍历环的时候也需要记录走形如",{"2":{"29":1}}],["以管理员身份运行此程序",{"2":{"23":1}}],["目前为止知道了如果",{"2":{"29":1}}],["目录",{"0":{"0":1},"1":{"0":1},"2":{"0":1},"4":{"0":1}}],["经过2小时的苦干后",{"2":{"29":1}}],["经过大量研究后发现",{"2":{"29":1}}],["经典题目",{"2":{"22":1},"4":{"22":1}}],["卡在某个样例上",{"2":{"29":1}}],["程序卡住等",{"2":{"29":1}}],["碰到地情况包括但不限于输出错误答案",{"2":{"29":1}}],["碰到了这个东西",{"2":{"26":1}}],["外加每个常量是没有出边的",{"2":{"29":1}}],["外层循环枚举",{"2":{"24":1}}],["发现这是个基环森林",{"2":{"29":1}}],["发现经过所有的操作之后每个变量要么等于一个常量",{"2":{"29":1}}],["忘记",{"2":{"29":1}}],["半小时之后完成",{"2":{"29":1}}],["拿到密码后开始干题目",{"2":{"29":1}}],["进考场以后就是调机器等密码",{"2":{"29":1}}],["他们在修路",{"2":{"29":1}}],["他们也可以投和自己本来意愿相反的票",{"2":{"12":1}}],["多到考场",{"2":{"29":1}}],["早上起来睡得不错",{"2":{"29":1}}],["开始担心自己做的",{"2":{"29":1}}],["开心地写好一个程序",{"2":{"29":1}}],["开考",{"2":{"29":1},"4":{"29":1}}],["开头的可消去子串的数量",{"2":{"28":1}}],["前几次",{"2":{"29":1}}],["70cc7ff27245e82ad414",{"0":{"52":1},"1":{"52":1}}],["709",{"2":{"16":1}}],["72505e6a122c6acd5471",{"0":{"45":1},"1":{"45":1}}],["7",{"2":{"28":1}}],["维护",{"2":{"28":1}}],["维护每个点的",{"2":{"3":1}}],["给",{"2":{"28":1}}],["哈希",{"2":{"28":1},"4":{"28":1}}],["存在的话",{"2":{"28":1}}],["存在",{"2":{"28":1}}],["存在常数",{"2":{"8":2}}],["上有原题",{"2":{"28":1}}],["上面每条边的权值等于这条边的容量",{"2":{"12":1},"4":{"12":1}}],["做一个哈希",{"2":{"28":1}}],["做法2",{"2":{"28":1},"4":{"28":1}}],["做法1",{"2":{"28":1},"4":{"28":1}}],["做出来了",{"2":{"28":1}}],["做商",{"2":{"26":1}}],["复赛",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["复杂度往往达不到这个上界",{"2":{"12":1}}],["复杂度",{"2":{"3":3,"12":3}}],["内",{"2":{"27":1}}],["内层循环枚举",{"2":{"24":1}}],["三个分量都相等时方程才有解",{"2":{"27":1}}],["通道实现的",{"2":{"27":1}}],["通常它们可以写成如下形式",{"2":{"22":1}}],["通常运行速度达不到这个上界这么慢",{"2":{"12":1}}],["格式的",{"2":{"27":1}}],["幻影坦克",{"0":{"27":1},"1":{"27":1},"2":{"27":1},"4":{"27":1}}],["参考资料",{"2":{"26":1},"4":{"26":1}}],["式子两端各自减去两个不动点",{"2":{"26":1}}],["式子两端减去一个不动点",{"2":{"26":1}}],["牛顿迭代法求",{"2":{"26":1}}],["形成等比数列",{"2":{"26":1}}],["形成等差数列",{"2":{"26":1}}],["形式化地",{"2":{"12":2}}],["今天复习数列",{"2":{"26":1}}],["会得到一条新的路径",{"2":{"25":1}}],["会变时方程是这样的",{"2":{"14":1}}],["会变时还是这样的吗",{"2":{"14":1}}],["必定在某个环上",{"2":{"29":1}}],["必定与",{"2":{"25":1}}],["必须放在一起",{"2":{"12":1}}],["欲证明",{"2":{"25":1}}],["沿负环增广",{"2":{"25":1}}],["先写了一个暴力",{"2":{"29":1}}],["先找到一个最大流",{"2":{"25":1}}],["先把astyle文件夹剪切到",{"2":{"23":1}}],["本文暂时略过",{"2":{"25":1}}],["本文只考虑整数容量",{"2":{"12":1}}],["除了条件要反一下",{"2":{"24":1}}],["除到右边即可得到上述方程",{"2":{"14":1}}],["超集的结果",{"2":{"24":1}}],["超集dp",{"2":{"24":2}}],["超级源到",{"2":{"12":1}}],["子集dp和超集dp的转移方程基本是一样的",{"2":{"24":1}}],["子集dp",{"2":{"24":2}}],["集合dp",{"0":{"24":1},"1":{"24":1},"2":{"24":1},"4":{"24":1}}],["美化",{"2":{"23":1},"4":{"23":1}}],["文件夹中以管理员身份启动命令行",{"2":{"23":1}}],["放到一个没有权限问题的地方",{"2":{"23":1}}],["快捷方式不行",{"2":{"23":1}}],["快读模版",{"0":{"17":1},"1":{"17":1},"2":{"17":1},"4":{"17":1}}],["另一个解决办法就是用目录联接",{"2":{"23":1}}],["很麻烦",{"2":{"23":1}}],["窗口",{"2":{"23":1}}],["打勾",{"2":{"23":1}}],["兼容性",{"2":{"23":1}}],["属性",{"2":{"23":1}}],["右键dev",{"2":{"23":1}}],["右侧点还有未匹配的",{"2":{"13":1}}],["下面是几个例子",{"2":{"26":1}}],["下的文件夹有权限问题",{"2":{"23":1}}],["下图中每条边的边权都是1",{"2":{"12":1}}],["让astyle能工作",{"2":{"23":1},"4":{"23":1}}],["翻新编译器",{"2":{"23":1},"4":{"23":1}}],["猜蒙凑",{"2":{"22":1}}],["凸性可以通过暴力算法打印数据找规律",{"2":{"22":1}}],["具体哪个忘了",{"2":{"29":1}}],["具体做法",{"2":{"23":1}}],["具体问题具体分析",{"2":{"19":1}}],["具有凸性",{"2":{"22":1}}],["来找到答案",{"2":{"22":1}}],["来估计算法复杂度",{"2":{"12":1}}],["简单",{"2":{"22":1}}],["简单题",{"2":{"5":1}}],["关于不同的限制",{"2":{"22":1}}],["关于",{"2":{"22":2}}],["关于k的循环必须在最外层",{"2":{"4":1}}],["该定理可以用反证法简单地证明",{"2":{"22":1}}],["引入",{"2":{"22":1},"4":{"22":1}}],["引理",{"2":{"12":1}}],["原题的代码",{"2":{"28":1}}],["原题",{"2":{"28":1}}],["原始论文",{"2":{"22":1}}],["原来是被攻击了",{"2":{"15":1}}],["worker",{"0":{"84":1},"1":{"84":1}}],["woff",{"0":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["woff2",{"0":{"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"56":1}}],["webpage",{"0":{"81":1},"1":{"81":1}}],["wasm",{"0":{"43":2,"83":1},"1":{"43":1,"83":1}}],["wqs二分",{"0":{"22":1},"1":{"22":1},"2":{"22":1},"4":{"22":1}}],["www",{"2":{"16":1,"23":2,"26":1}}],["相当于在近似",{"2":{"21":1}}],["优化还是能用",{"2":{"20":1}}],["优先队列复杂度比暴力更优",{"2":{"3":1}}],["优先队列",{"2":{"3":1},"4":{"3":1}}],["均摊枚举决策的循环",{"2":{"20":1}}],["降低到",{"2":{"20":1}}],["区间包含单调性",{"2":{"20":1}}],["保证",{"2":{"19":1}}],["数组中一段相同的值",{"2":{"19":1}}],["数值",{"2":{"2":2}}],["合并",{"2":{"19":1}}],["四边形不等式",{"2":{"19":1,"20":1}}],["有点像",{"2":{"29":1}}],["有一个非空交集",{"2":{"25":1}}],["有单调性",{"2":{"22":1}}],["有满足",{"2":{"22":1}}],["有",{"2":{"19":2,"20":1}}],["作为一段的代价",{"2":{"19":1}}],["决策单调性优化",{"0":{"19":1,"20":1},"1":{"19":1,"20":1},"2":{"19":1,"20":1},"4":{"19":1,"20":1}}],["6f941aaa7e2f4706b7820ba28f656d4c",{"2":{"18":1}}],["配置文件",{"2":{"18":1}}],["推荐oi类和装饰性拓展",{"2":{"18":1},"4":{"18":1}}],["块内排序",{"2":{"16":1}}],["块i到块j的这段区间内的逆序对数量",{"2":{"16":1}}],["算是一个好结局吧",{"2":{"29":1}}],["算pre和suf",{"2":{"16":1}}],["算法终止条件",{"2":{"12":1}}],["算法找到了一个流",{"2":{"12":1}}],["算法就要找200次增广路了",{"2":{"12":1}}],["算法",{"2":{"12":1,"25":1},"4":{"12":1}}],["算法结束",{"2":{"3":1}}],["算法过程",{"2":{"3":1},"4":{"3":1}}],["runner",{"2":{"18":1}}],["r",{"2":{"16":25,"19":20}}],["render",{"0":{"84":1},"1":{"84":1}}],["regular",{"0":{"59":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"71":1,"73":1,"76":1,"77":1,"78":1},"1":{"59":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"71":1,"73":1,"76":1,"77":1,"78":1}}],["res",{"0":{"32":1},"1":{"32":1},"2":{"16":3}}],["residual",{"2":{"12":2},"4":{"12":1}}],["remaining",{"2":{"16":1,"17":1}}],["return",{"2":{"7":1,"12":7,"13":3,"16":3,"19":1,"28":2}}],["yao",{"2":{"20":1}}],["y",{"2":{"16":15}}],["y表示流量",{"2":{"12":1},"4":{"12":1}}],["~",{"2":{"16":1,"17":1}}],["94f2f163d4b698242fef",{"0":{"44":1},"1":{"44":1}}],["9",{"2":{"16":3,"17":2}}],["提交次数多达两页半",{"2":{"16":1}}],["题目",{"2":{"16":1}}],["题面",{"2":{"7":1},"4":{"7":1}}],["纪念一下",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["毒瘤题",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["现在彻底寄了",{"2":{"15":1}}],["似乎现在开始恢复了",{"2":{"15":1}}],["3e5",{"2":{"28":1}}],["30",{"2":{"20":1}}],["370",{"2":{"16":1}}],["3",{"2":{"15":1,"20":1,"26":1},"4":{"26":1}}],["希望它赶快搞好吧",{"2":{"15":1}}],["请过几分钟回来",{"2":{"15":1}}],["虽然上面说",{"2":{"15":1}}],["虽然每个人都有自己的主见",{"2":{"12":1}}],["好像在进行维护工作",{"2":{"15":1}}],["好朋友之间连一条权值为1的双向边",{"2":{"12":1}}],["云图床",{"2":{"15":1}}],["云图床炸了",{"0":{"15":1},"1":{"15":1},"2":{"15":1},"4":{"15":1}}],["向反方向喷射气体",{"2":{"14":1}}],["向0取整",{"2":{"1":1}}],["火箭方程",{"2":{"14":1},"4":{"14":1}}],["例子",{"2":{"14":1},"4":{"14":1}}],["例题",{"2":{"12":1},"4":{"12":1}}],["速度从",{"2":{"14":2}}],["增加的质量",{"2":{"14":1}}],["增广前后没有变化",{"2":{"25":2}}],["增广后产生了一个负环",{"2":{"25":1}}],["增广的时候就应该找到这条增广路了",{"2":{"13":1}}],["增广路",{"2":{"13":1}}],["增广路径就是残量网络上从源点到汇点的一条路径",{"2":{"12":1}}],["变质量系统中力与动量的关系",{"0":{"14":1},"1":{"14":1},"2":{"14":1},"4":{"14":1}}],["变成",{"2":{"4":2,"14":2}}],["间交替的路径",{"2":{"13":1}}],["比",{"2":{"22":1}}],["比m更大",{"2":{"13":1}}],["比匹配m更大",{"2":{"13":1}}],["比如有",{"2":{"12":1}}],["比如对于这个二分图",{"2":{"12":1}}],["比如我们之前选的流不够好",{"2":{"12":1}}],["比如修改",{"2":{"9":1}}],["比如",{"2":{"1":1}}],["条件是当前的匹配m下二分图不存在增广路",{"2":{"13":1}}],["返回值代表有没有找到增广路",{"2":{"13":1}}],["综上",{"2":{"13":2}}],["没有增广路之后就得到了最大匹配",{"2":{"13":1}}],["没有边",{"2":{"4":1}}],["反方向不好证明",{"2":{"25":1}}],["反之亦然",{"2":{"13":1}}],["反向边省略",{"2":{"12":1}}],["枚举起点时",{"2":{"13":1}}],["枚举起点",{"2":{"13":1}}],["起点和终点都不参与匹配的交错路",{"2":{"13":1}}],["交错路",{"2":{"13":1}}],["匈牙利算法",{"2":{"13":1},"4":{"13":1}}],["选出来的点确实组成点覆盖",{"2":{"13":1}}],["选的点都是匹配边的端点",{"2":{"13":1}}],["选取它的左端点",{"2":{"13":1}}],["重复过步骤1之后",{"2":{"13":1}}],["重复步骤1",{"2":{"13":1}}],["重复3",{"2":{"3":1}}],["只要它的前两个参数满足上面两个条件",{"2":{"20":1}}],["只可能会新增匹配点",{"2":{"13":1}}],["只有一条边也可以",{"2":{"13":1}}],["只有右端点参与匹配",{"2":{"13":1}}],["只有左端点参与匹配",{"2":{"13":1}}],["只需要输出得分模",{"2":{"7":1}}],["两道有意思的微积分题目",{"0":{"21":1},"1":{"21":1},"2":{"21":1},"4":{"21":1}}],["两端点都参与匹配",{"2":{"13":1}}],["两倍不会溢出的",{"2":{"2":1}}],["非匹配边",{"2":{"13":3}}],["匹配边变非匹配边",{"2":{"13":1}}],["匹配边",{"2":{"13":1}}],["点数最少的点覆盖",{"2":{"13":1}}],["点覆盖",{"2":{"13":1}}],["节点的集合",{"2":{"13":1}}],["同阵营奖励",{"2":{"12":1}}],["常见结构",{"2":{"12":1},"4":{"12":1}}],["割左边的话就没必要割右边了",{"2":{"12":1}}],["割的大小定义为",{"2":{"12":1}}],["全部割掉才能使图不连通",{"2":{"12":1}}],["或者",{"2":{"24":1}}],["或者减少的质量",{"2":{"14":1}}],["或2个3个",{"2":{"12":1}}],["或集合",{"2":{"12":1}}],["图中蓝边",{"2":{"12":1}}],["图中橙边",{"2":{"12":1}}],["按照割边来理解",{"2":{"12":1},"4":{"12":1}}],["按照集合划分理解",{"2":{"12":1},"4":{"12":1}}],["求不动点",{"2":{"26":1}}],["求min",{"2":{"24":1}}],["求加法的相应dp叫做",{"2":{"24":1}}],["求出后就从右到左看它能更新哪些",{"2":{"19":1}}],["求出最小割",{"2":{"12":1}}],["求最小消耗",{"2":{"12":1}}],["偶格子是",{"2":{"12":1}}],["偶格子也是",{"2":{"12":1}}],["偶格子不能是",{"2":{"12":1}}],["奇格子是",{"2":{"12":2}}],["里是选",{"2":{"12":1}}],["里是选它",{"2":{"12":1}}],["里是不选",{"2":{"12":1}}],["里是不选它",{"2":{"12":1}}],["里面三层循环可以任意交换顺序",{"2":{"4":1}}],["考场上",{"2":{"28":1}}],["考场上没思路",{"2":{"5":1}}],["考虑一个栈",{"2":{"28":1}}],["考虑一个割",{"2":{"12":1}}],["考虑无限制问题",{"2":{"22":1}}],["权值为",{"2":{"12":1}}],["权值为格子中的值",{"2":{"12":2}}],["接下来状态压缩",{"2":{"28":1}}],["接下来证明反方向",{"2":{"13":1}}],["接下来证明要更新的是",{"2":{"9":1}}],["接下来考虑所有非匹配边",{"2":{"13":1}}],["接下来我们这么构造点覆盖",{"2":{"13":1}}],["接下来我们只要能构造出一个等于最大匹配数的点覆盖就可以证明konig定理",{"2":{"13":1}}],["接下来n行是n",{"2":{"12":1}}],["且暴力感觉不好写",{"2":{"29":1}}],["且",{"2":{"26":1}}],["且两层循环的枚举顺序可以任意",{"2":{"24":1}}],["且取出的数的总和尽量大",{"2":{"12":1}}],["且边权非负",{"2":{"3":1}}],["使",{"2":{"22":2}}],["使用反证法",{"2":{"13":1,"25":1}}],["使用bfs分层+dfs多路探索以及当前弧加速",{"2":{"12":1}}],["使得任意两个取出的数所在格子没有公共边",{"2":{"12":1}}],["再加上直接是常量",{"2":{"29":1}}],["再将",{"2":{"14":1}}],["再跑最小割就能得到答案了",{"2":{"12":1}}],["再看osu拓展",{"0":{"10":1},"1":{"10":1},"2":{"7":1,"10":1},"4":{"10":1}}],["才能使冲突数最小",{"2":{"12":1}}],["幼儿园里有n个小朋友打算通过投票来决定睡不睡午觉",{"2":{"12":1}}],["在七宝中学",{"2":{"29":1}}],["在暗背景下显示颜色",{"2":{"27":1}}],["在预览和点开的时候显示不一样的图",{"2":{"27":1}}],["在增广之前的图中存在",{"2":{"25":1}}],["在大小相同的流之中",{"2":{"25":1}}],["在此基础上",{"2":{"13":1}}],["在最后一步之后",{"2":{"13":1}}],["在最大匹配中",{"2":{"13":1}}],["在一个二分图中",{"2":{"13":1}}],["在一个n",{"2":{"12":1}}],["在",{"2":{"12":4,"14":1,"21":1,"22":1}}],["在这张图上跑最小割",{"2":{"12":1}}],["在有些图上运行时间会和容量成正比",{"2":{"12":1}}],["连权值为",{"2":{"12":1}}],["连续极长的成功点击序列",{"2":{"7":1}}],["类型的问题建模",{"2":{"12":1},"4":{"12":1}}],["类似于堆",{"2":{"3":1}}],["二选一",{"2":{"12":2},"4":{"12":1}}],["二分图最大匹配",{"2":{"12":1},"4":{"12":1}}],["二项式定理做法",{"2":{"10":1},"4":{"10":1}}],["然而",{"2":{"12":1}}],["然后开始考虑正解",{"2":{"29":1}}],["然后",{"2":{"28":1,"29":1}}],["然后再做商可得",{"2":{"26":1}}],["然后再上面跑一遍最大流就可以得到最大匹配了",{"2":{"12":1}}],["然后进行一定处理后能得到",{"2":{"26":1}}],["然后两式相减得",{"2":{"26":1}}],["然后不停地找负环",{"2":{"25":1}}],["然后在递推式两端减去不动点",{"2":{"26":1}}],["然后在",{"2":{"23":1}}],["然后在残量图上修改相应的流量",{"2":{"12":1}}],["然后右边连接着的偶格子就有保留的机会了",{"2":{"12":1}}],["然后修改残量图并给答案加上这个流",{"2":{"12":1}}],["然后根据",{"2":{"12":1}}],["然后mathjax就不能正常渲染数学公式了",{"2":{"11":1}}],["得",{"2":{"26":1,"27":1}}],["得出",{"2":{"19":1,"22":1}}],["得到一个割",{"2":{"12":1}}],["得分是",{"2":{"7":1}}],["于是就开始疯狂修改",{"2":{"29":1}}],["于是给每个变量一个点",{"2":{"29":1}}],["于是",{"2":{"25":1,"26":2}}],["于是如果",{"2":{"19":1,"29":1}}],["于是回路一定是偶数长度的",{"2":{"13":1}}],["于是所有边都被覆盖了",{"2":{"13":1}}],["于是他们决定发扬谦让精神",{"2":{"12":1}}],["于是我们可以把点划分为",{"2":{"12":1}}],["于是这个过程一定可以终止",{"2":{"9":1}}],["那",{"2":{"22":1}}],["那对于所有",{"2":{"19":1}}],["那之后也不可能再找到增广路",{"2":{"13":1}}],["那增广后它就不能再作为起点",{"2":{"13":1}}],["那这个割就不可能是最小割了",{"2":{"12":1}}],["那我们可以先建立一个超级源和超级汇",{"2":{"12":1}}],["那残量网络中肯定没有从",{"2":{"12":1}}],["那么这个分量就必须全是",{"2":{"29":1}}],["那么这时候",{"2":{"28":1}}],["那么每次更新就是",{"2":{"28":1}}],["那么就说明",{"2":{"28":1}}],["那么就消掉",{"2":{"28":1}}],["那么就有这样的关系",{"2":{"28":1}}],["那么就表示我不要奇格子",{"2":{"12":1}}],["那么两式都不为0",{"2":{"26":1}}],["那么由",{"2":{"26":1}}],["那么不动点有1个或者2个",{"2":{"26":1}}],["那么要求它的通项公式",{"2":{"26":1}}],["那么经过一条最短路增广之后不会产生负环",{"2":{"25":1}}],["那么对于所有",{"2":{"20":1}}],["那么我们可以得到如下方程",{"2":{"14":1}}],["那么我就必须把相应的4个",{"2":{"12":1}}],["那么在",{"2":{"14":1}}],["那么d中的边要么能组成长度为偶数的回路",{"2":{"13":1}}],["那么以它们为起点不可能有增广路",{"2":{"13":1}}],["那么其实是不划算的",{"2":{"12":1}}],["那么如果存在一个流和一个割满足",{"2":{"12":1}}],["那么有",{"2":{"12":1,"26":1}}],["那么",{"2":{"8":1,"12":1,"19":1,"22":1,"28":1}}],["那么用",{"2":{"1":1}}],["当",{"2":{"27":1,"28":2}}],["当且仅当它对应的残量网络中不存在负环",{"2":{"25":1}}],["当然",{"2":{"20":1}}],["当然还不知道是最大流",{"2":{"12":1}}],["当前弧加速就是说",{"2":{"12":1}}],["当前弧加速是必须要有的",{"2":{"12":1}}],["由于原先没有负环",{"2":{"25":1}}],["由于残量图中",{"2":{"12":1}}],["由这个定理",{"2":{"25":1}}],["由上述定理可以看到",{"2":{"22":1}}],["由上面的引理容易得到对任意的流和割",{"2":{"12":1}}],["由牛顿第二定律可以得出",{"2":{"14":1}}],["由匹配边与非匹配边交错而成",{"2":{"13":1}}],["由引理可得",{"2":{"12":1}}],["由此",{"2":{"26":1}}],["由此可见这是保证了不能选相邻格子的限制的",{"2":{"12":1}}],["由此可以推出",{"2":{"12":1}}],["由此可以看出正解的正确性",{"2":{"10":1}}],["由此得出",{"2":{"9":1}}],["可消去且",{"2":{"28":1}}],["可消去的最小的",{"2":{"28":1}}],["可列出方程组",{"2":{"27":1}}],["可得",{"2":{"26":1,"27":1}}],["可达的",{"2":{"12":1}}],["可达点和",{"2":{"12":1}}],["可以这么求",{"2":{"28":1}}],["可以看到",{"2":{"24":1,"27":1}}],["可以用",{"2":{"12":1}}],["可以用快速幂计算",{"2":{"4":1}}],["可以达到",{"2":{"12":1}}],["可以证明这个运算是满足结合律的",{"2":{"4":1}}],["可以证明第一维是可以被滚动优化掉的",{"2":{"4":1}}],["等价是因为最小割肯定是分为",{"2":{"12":1}}],["就直接输出了一个样例",{"2":{"29":1}}],["就建一条",{"2":{"29":1}}],["就有单调性",{"2":{"22":1}}],["就算",{"2":{"20":1}}],["就把这块丢掉",{"2":{"19":1}}],["就能使匹配数增加一",{"2":{"13":1}}],["就能把第二种和第四种覆盖",{"2":{"13":1}}],["就代表都不选",{"2":{"12":1}}],["就代表不选奇格子",{"2":{"12":1}}],["就代表不选偶格子",{"2":{"12":1}}],["就可以通过二分",{"2":{"22":1}}],["就可以得到最小消耗",{"2":{"12":1}}],["就可以证明该定理",{"2":{"12":1}}],["就可以求所要的前缀和了",{"2":{"9":1}}],["就是强化版决策单调性",{"2":{"19":1}}],["就是个不合法的匹配",{"2":{"13":1}}],["就是最小的不选的总和了",{"2":{"12":1}}],["就是满足",{"2":{"12":1}}],["就是不需要每次都从源点开始找增广路径",{"2":{"12":1}}],["||",{"2":{"12":1,"13":1,"16":1,"17":1}}],["后来出成绩了",{"2":{"29":1}}],["后来知道了并查集做多简单",{"2":{"29":1}}],["后记",{"2":{"29":1},"4":{"29":1}}],["后面再来这个结点的时候不需要再走这条边了",{"2":{"12":1}}],["后在它上面dfs多路探索得到它上最大的流",{"2":{"12":1}}],["每个常量一个点",{"2":{"29":1}}],["每个变量逆一个点",{"2":{"29":1}}],["每个非匹配点只需要被枚举一次",{"2":{"13":1}}],["每个格子里都有一个正整数",{"2":{"12":1}}],["每位小朋友应该怎样投票",{"2":{"12":1}}],["每轮bfs求出",{"2":{"12":1}}],["每次加入一个序列中的元素",{"2":{"28":1}}],["每次都按管理员身份启动",{"2":{"23":1}}],["每次dfs前要重置这个",{"2":{"12":1}}],["每次通过bfs找一条增广路径",{"2":{"12":1},"4":{"12":1}}],["每次通过dfs找一条增广路径",{"2":{"12":1},"4":{"12":1}}],["每次可以可能成功或失败",{"2":{"7":1}}],["每次循环能标记一个点",{"2":{"3":1}}],["红边层次图",{"2":{"12":1}}],["黑边残量图",{"2":{"12":1}}],["为止的栈",{"2":{"28":1}}],["为了让值得范围保持在",{"2":{"27":1}}],["为了便于讨论",{"2":{"12":1}}],["为msk改变后p位能形成的msk子集",{"2":{"24":1}}],["为例子",{"2":{"24":1}}],["为",{"2":{"12":1,"28":2}}],["为从源点bfs到u的轮数+1",{"2":{"12":1}}],["ams",{"0":{"68":1},"1":{"68":1}}],["aug",{"0":{"33":1},"1":{"33":1}}],["augmenting",{"2":{"12":1,"13":1}}],["a图偏亮",{"2":{"27":1}}],["alpha",{"2":{"27":1}}],["alternating",{"2":{"13":1}}],["astyle下创建临时文件",{"2":{"23":1}}],["astyle",{"2":{"23":4}}],["add",{"2":{"16":3}}],["answer",{"2":{"23":1,"26":1}}],["ans",{"2":{"16":8,"19":3,"28":6}}],["aj与第i块中的数形成的逆序对数量",{"2":{"16":1}}],["a1",{"2":{"16":1}}],["ab这条边为",{"2":{"12":1}}],["acceleration",{"2":{"12":1}}],["arc",{"2":{"12":1}}],["代入",{"2":{"12":1}}],["代码",{"2":{"3":1,"4":2,"12":1,"13":1,"16":1},"4":{"3":1,"12":1,"13":1}}],["^",{"2":{"12":3,"16":2}}],["实际上",{"2":{"14":1}}],["实际上流的斜对称性就是用来",{"2":{"12":1}}],["实际效果",{"2":{"12":2}}],["找到之后反转一下",{"2":{"13":1}}],["找到的增广路径叫做最短步数增广路",{"2":{"12":1}}],["找无向图最小环和检测负环",{"2":{"4":1}}],["动能算法",{"2":{"12":1}}],["退流",{"2":{"12":1}}],["这一维可以滚动数组优化",{"2":{"24":1}}],["这里就记录一下",{"2":{"28":1}}],["这里以",{"2":{"24":1}}],["这里的加法也可以换成",{"2":{"24":1}}],["这里的",{"2":{"23":1}}],["这样有时候能凑出一些特殊的容易处理的结构",{"2":{"26":1}}],["这样就可以把每个集合映射到一个整数了",{"2":{"24":1}}],["这样在枚举决策就只用枚举",{"2":{"20":1}}],["这样的一条路径一定是以m",{"2":{"13":1}}],["这是因为若四边形不等式满足",{"2":{"19":1}}],["这是多路探索",{"2":{"12":1}}],["这就意味着存在一条增广路",{"2":{"13":1}}],["这就是增广路定理",{"2":{"12":1}}],["这么建图",{"2":{"12":1}}],["这条边其实不在层次图里面",{"2":{"12":1}}],["这条边所有的流量已经被用掉了",{"2":{"12":1}}],["这个条件不对",{"2":{"29":1}}],["这个优化英文叫",{"2":{"20":1}}],["这个定理保证了上述算法的正确性",{"2":{"13":1}}],["这个问题很符合上面",{"2":{"12":1}}],["这个问题并不是很重要",{"2":{"12":1}}],["这个就是当前弧加速",{"2":{"12":1}}],["这个区间了",{"2":{"9":1}}],["这个区间的和",{"2":{"9":1}}],["这个式子经常过高估计欧拉法的误差",{"2":{"8":1}}],["这个题不错",{"2":{"7":1}}],["我目前博客里大部分图片都上传在它上面",{"2":{"15":1}}],["我们把复数解也考虑进来",{"2":{"26":1}}],["我们需要证明算法过程中不会产生负环",{"2":{"25":1}}],["我们可以先求出它的不动点",{"2":{"26":1}}],["我们可以得到负环消去算法",{"2":{"25":1}}],["我们可以从超级源向每个要睡觉的小朋友连一条权值为1的边",{"2":{"12":1}}],["我们通过二进制表示集合",{"2":{"24":1}}],["我们想要知道的是",{"2":{"24":1}}],["我们就能更容易地解决原问题",{"2":{"22":1}}],["我们就可以提前决定不去走它们",{"2":{"12":1}}],["我们就可以得到最大流",{"2":{"12":1}}],["我们有时候需要解决在一定限制下的最优化问题",{"2":{"22":1}}],["我们只需要枚举每个左侧点1次",{"2":{"13":1}}],["我们只需要枚举左侧点",{"2":{"13":1}}],["我们的问题就是",{"2":{"12":1}}],["我们定义一次投票的冲突数为好朋友之间发生冲突的总数加上和所有和自己本来意愿发生冲突的人数",{"2":{"12":1}}],["我终于想明白算法的正确性了",{"2":{"10":1}}],["直到没有负环为止",{"2":{"25":1}}],["直到没有任何增广路径",{"2":{"12":1}}],["直到没有未访问的点",{"2":{"3":1}}],["一眼不会做",{"2":{"29":1}}],["一眼大水题",{"2":{"29":1}}],["一定比",{"2":{"25":1}}],["一般来说",{"2":{"22":1}}],["一般记作",{"2":{"12":1},"4":{"12":1}}],["一条m",{"2":{"13":1}}],["一条m的",{"2":{"13":1}}],["一条边有四种情况",{"2":{"13":1}}],["一个流的费用是最小的",{"2":{"25":1}}],["一个重要的定理",{"2":{"25":1}}],["一个方法就是设置",{"2":{"23":1}}],["一个真空中的火箭以相对自身的速度",{"2":{"14":1}}],["一个匹配是最大匹配当且仅当这个二分图中不存在增广路",{"2":{"13":1}}],["一个割",{"2":{"12":1}}],["一共有",{"2":{"7":1}}],["残量网络",{"2":{"12":1},"4":{"12":1}}],["流的大小定义为",{"2":{"12":1}}],["流入一个点的流量等于流出这个点的流量",{"2":{"12":1}}],["流守恒性",{"2":{"12":1}}],["流量",{"2":{"12":1}}],["流量网络",{"2":{"12":1},"4":{"12":1}}],["斜对称性",{"2":{"12":1}}],["x86",{"2":{"23":1}}],["x到它所在块块尾的区间内的逆序对数量",{"2":{"16":1}}],["x到它所在块块首的区间内的逆序对数量",{"2":{"16":1}}],["x",{"2":{"12":1,"16":24,"17":15,"19":4},"4":{"12":1}}],["加了流量的网络",{"2":{"12":1},"4":{"12":1}}],["加了容量的网络",{"2":{"12":1},"4":{"12":1}}],["规定",{"2":{"12":1}}],["容量限制",{"2":{"12":1}}],["容量",{"2":{"12":2},"4":{"12":1}}],["容量网络",{"2":{"12":1},"4":{"12":1}}],["源点",{"2":{"12":1}}],["网络",{"2":{"12":1}}],["网络流入门",{"0":{"12":1},"1":{"12":1},"2":{"12":1},"4":{"12":1}}],["首先求不动点",{"2":{"26":1}}],["首先无限大的边肯定不能割",{"2":{"12":1}}],["首先把格子按行号与列号的和的奇偶性分类",{"2":{"12":1}}],["首先",{"2":{"12":1,"13":2,"26":1}}],["首先已经被已经访问过的点松弛过了",{"2":{"3":1}}],["什么是网络流",{"2":{"12":1},"4":{"12":1}}],["但不能达到",{"2":{"12":1}}],["但一部分论证可以直接推广到非整数流的问题上",{"2":{"12":1}}],["但是注意到这几个环圈肯定在增广之前就存在",{"2":{"25":1}}],["但是更常见的算法是",{"2":{"25":1}}],["但是由于它会在devcpp",{"2":{"23":1}}],["但是它的年代有点太老了",{"2":{"23":1}}],["但是它已经维护了好几天了",{"2":{"15":1}}],["但是很多时候这样的问题难以直接解决",{"2":{"22":1}}],["但是这么做是",{"2":{"28":1}}],["但是这么做这些latex就不能在其他地方正常渲染了",{"2":{"11":1}}],["但是这样每次都会弹出",{"2":{"23":1}}],["但是这与",{"2":{"25":1}}],["但是这与条件不存在增广路矛盾",{"2":{"13":1}}],["但是这与所有左侧点已经被增广过矛盾",{"2":{"13":1}}],["但是为了照顾一下自己朋友的想法",{"2":{"12":1}}],["但是复杂度很差",{"2":{"12":1}}],["但是",{"2":{"7":1}}],["但是20炸了",{"2":{"5":1}}],["但是我错误得估计了复杂度",{"2":{"5":1}}],["但是没有修改和删除操作",{"2":{"3":1}}],["整数流",{"2":{"12":1}}],["整数数据范围",{"2":{"2":1},"4":{"2":1}}],["整数数据范围和memset初值",{"0":{"2":1},"1":{"2":1},"2":{"2":1},"4":{"2":1}}],["注意到这个路径中在m",{"2":{"13":1}}],["注意到这个过程中原先的匹配点不会变成非匹配点",{"2":{"13":1}}],["注意到由1和2",{"2":{"12":1}}],["注意",{"2":{"12":1}}],["注",{"2":{"12":1}}],["之后会论证这个定理",{"2":{"12":1}}],["之后就好很多",{"2":{"11":1}}],["之类的",{"2":{"9":1}}],["on",{"2":{"24":2}}],["optimality",{"2":{"25":1}}],["opt",{"2":{"19":2,"20":5}}],["orz",{"2":{"17":1}}],["other",{"0":{"91":1},"1":{"91":1}}],["otf",{"0":{"44":1}}],["ot",{"2":{"16":2,"17":2}}],["os",{"2":{"16":6,"17":6}}],["osu拓展",{"0":{"7":1},"1":{"7":1},"2":{"7":1,"10":1},"4":{"7":1}}],["osu",{"0":{"6":1},"1":{"6":1},"2":{"6":1,"7":2},"4":{"6":1}}],["obuf",{"2":{"16":5,"17":5}}],["obsidian",{"0":{"90":1},"1":{"90":1},"2":{"11":1}}],["用",{"2":{"11":1,"19":1,"28":1}}],["用来解决限定步数的最短",{"2":{"4":1}}],["需要在一些地方用反斜杠escape掉那些字符才行",{"2":{"11":1}}],["需要更新",{"2":{"9":1}}],["它可以由",{"2":{"19":1}}],["它们是通过",{"2":{"27":1}}],["它们对应的是周期数列",{"2":{"26":1}}],["它们在m中一定是未匹配点",{"2":{"13":1}}],["它们的组合意义相同",{"2":{"10":1}}],["它连着的偶格子都是",{"2":{"12":1}}],["它是用于保证时间复杂度正确性的一部分",{"2":{"12":1}}],["它就能撤销掉之前的流",{"2":{"12":1}}],["它要满足如下三个性质",{"2":{"12":1}}],["它的",{"2":{"3":1}}],["书接上文",{"2":{"10":1}}],["时以当前位置结尾的可消去子序列数量",{"2":{"28":1}}],["时",{"2":{"28":2}}],["时刻时",{"2":{"14":1}}],["时不断",{"2":{"9":1}}],["时的累积误差",{"2":{"8":1}}],["即可",{"2":{"23":1}}],["即可使用此优化",{"2":{"19":1}}],["即求",{"2":{"22":1}}],["即最大流等于最小割",{"2":{"12":1}}],["即剩余流量",{"2":{"12":1}}],["即",{"2":{"9":1,"19":1,"20":1}}],["即c++的整除",{"2":{"1":1}}],["第2个样例就假了",{"2":{"29":1}}],["第",{"2":{"12":1}}],["第二题",{"2":{"12":1,"21":1},"4":{"12":1,"21":1}}],["第二个参数也是同理",{"2":{"12":1}}],["第二部",{"2":{"9":1},"4":{"9":1}}],["第一行是n",{"2":{"12":1}}],["第一题",{"2":{"12":1,"21":1},"4":{"12":1,"21":1}}],["第一个盒子和最后一个盒子非空",{"2":{"10":1}}],["第一步",{"2":{"9":1},"4":{"9":1}}],["都存在",{"2":{"28":1}}],["都可以列出转移方程",{"2":{"20":1}}],["都能写成这个形式",{"2":{"9":1}}],["都不比它小",{"2":{"3":1}}],["设能达成效果的颜色为",{"2":{"27":1}}],["设",{"2":{"9":2,"12":1}}],["设为无限大",{"2":{"3":1}}],["真包含于",{"2":{"9":1},"4":{"9":1}}],["证明略",{"2":{"28":1}}],["证明见参考资料",{"2":{"26":1}}],["证明在这篇论文里",{"2":{"20":2}}],["证明对任意满足",{"2":{"9":1},"4":{"9":1}}],["证明",{"2":{"9":1,"12":4,"13":1,"14":1,"25":1},"4":{"9":1,"13":1,"14":1}}],["分块",{"2":{"16":2}}],["分两步",{"2":{"9":1}}],["分数的递推式",{"2":{"6":1},"4":{"6":1}}],["更短",{"2":{"25":1}}],["更新",{"2":{"9":1},"4":{"9":1}}],["更小",{"2":{"3":1}}],["更小的未访问的点不存在",{"2":{"3":1}}],["显然是有解的",{"2":{"26":1}}],["显然这会让复杂度从",{"2":{"20":1}}],["显然这个过程也一定会终止",{"2":{"9":1}}],["显然会产生矛盾",{"2":{"12":1}}],["显然任意整数",{"2":{"9":1}}],["显然",{"2":{"9":1}}],["显然有",{"2":{"9":1}}],["显然最长路就是把",{"2":{"4":1}}],["根据定义",{"2":{"9":1}}],["询问",{"2":{"9":1},"4":{"9":1}}],["假设",{"2":{"26":1}}],["假设沿最短路",{"2":{"25":1}}],["假设匹配m",{"2":{"13":1}}],["假设左边的点编号为",{"2":{"13":1}}],["假设左侧点都被增广过之后",{"2":{"13":1}}],["假设我们有这样的一个递推式",{"2":{"26":1}}],["假设我们根据之前的",{"2":{"12":1}}],["假设我们用数据结构",{"2":{"3":1}}],["假设树状数组是",{"2":{"9":1}}],["树状数组bit正确性的证明",{"0":{"9":1},"1":{"9":1},"2":{"9":1},"4":{"9":1}}],["树上dp也没想出来",{"2":{"5":1}}],["满足每条边至少有一个端点被选",{"2":{"13":1}}],["满足",{"2":{"8":2,"20":1}}],["要证明这个算法的正确性",{"2":{"25":1}}],["要解决这个问题",{"2":{"23":1}}],["要解的微分方程",{"2":{"8":1}}],["要注意边界情况",{"2":{"20":1}}],["要么和另外一个变量的逆相等",{"2":{"29":1}}],["要么和另外一个变量相等",{"2":{"29":1}}],["要么m",{"2":{"13":1}}],["要么就是在m与m",{"2":{"13":1}}],["要消耗",{"2":{"12":2}}],["要满足的条件",{"2":{"8":1}}],["欧拉法",{"2":{"8":1}}],["欧拉法的误差分析",{"0":{"8":1},"1":{"8":1},"2":{"8":1},"4":{"8":1}}],["是不是有问题",{"2":{"29":1}}],["是用并查集做的了",{"2":{"29":1}}],["是用来格式化代码的一个程序",{"2":{"23":1}}],["是使得",{"2":{"28":1}}],["是负环",{"2":{"25":1}}],["是",{"2":{"23":1}}],["是指",{"2":{"14":1}}],["是指一个有向图",{"2":{"12":1}}],["是最短路矛盾",{"2":{"25":1}}],["是最简单的最大流算法",{"2":{"12":1}}],["是最大流",{"2":{"12":1}}],["是一个很常用的",{"2":{"23":1}}],["是一个",{"2":{"12":1}}],["是已知的",{"2":{"8":1}}],["是邻接矩阵",{"2":{"4":1}}],["而且增广前没有负环",{"2":{"25":1}}],["而且对于它的起点和终点",{"2":{"13":1}}],["而program",{"2":{"23":1}}],["而相应的没有限制的问题通常会更容易解决",{"2":{"22":1}}],["而形成回路的路径中在m中的边的数量与在m",{"2":{"13":1}}],["而如果不存在增广路",{"2":{"13":1}}],["而如果我不割左边割右边",{"2":{"12":1}}],["而如果我割左边一条边",{"2":{"12":1}}],["而一个点覆盖中每条边至少有一个端点被选",{"2":{"13":1}}],["而割左边是前面一个情况",{"2":{"12":1}}],["而多路探索是常数优化",{"2":{"12":1}}],["而对于",{"2":{"9":1}}],["而",{"2":{"8":1}}],["而其他的点的",{"2":{"3":1}}],["出处2",{"2":{"9":1}}],["出处1",{"2":{"9":1}}],["出处",{"2":{"8":1}}],["zero",{"0":{"58":1},"1":{"58":1}}],["zhuanlan",{"2":{"26":1}}],["zhihu",{"2":{"23":1,"26":2}}],["zao",{"2":{"23":1}}],["z",{"2":{"7":4}}],["lib",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1,"41":1,"42":1,"43":1,"44":1,"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"52":1,"53":1,"54":1,"55":1,"56":1,"57":1,"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1,"80":1,"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"88":1,"89":1,"90":1,"91":1,"92":1,"93":1,"94":1}}],["len",{"2":{"20":4}}],["lens",{"2":{"18":1}}],["lb",{"2":{"16":9}}],["lagrange",{"2":{"22":1},"4":{"22":1}}],["laofudasuan",{"2":{"17":1}}],["la",{"2":{"16":10}}],["latex和markdown冲突",{"0":{"11":1},"1":{"11":1},"2":{"11":1},"4":{"11":1}}],["l",{"2":{"16":27,"19":18}}],["ll",{"2":{"16":4,"19":2,"28":9}}],["lld",{"2":{"7":2,"19":1}}],["luogu",{"2":{"16":1,"23":1}}],["lvl",{"0":{"35":1},"1":{"35":1}}],["lv",{"2":{"12":10}}],["long",{"2":{"2":2,"7":12,"16":2,"28":4}}],["data",{"0":{"89":1},"1":{"89":1}}],["da",{"2":{"23":1}}],["dp",{"2":{"19":1,"20":1,"24":3,"28":8},"4":{"28":1}}],["devcpp",{"2":{"23":1}}],["dev",{"0":{"23":1},"1":{"23":1},"2":{"23":8},"4":{"23":2}}],["define",{"2":{"16":1,"17":1}}],["delta",{"2":{"12":5}}],["dfs",{"2":{"12":3}}],["dfs多路探索的时候我们要应用当前弧加速",{"2":{"12":1}}],["d",{"2":{"7":2,"12":1,"13":2,"16":2,"20":1,"23":2,"25":1,"28":3}}],["dinic",{"2":{"12":2},"4":{"12":1}}],["dijkstra",{"2":{"3":2}}],["dijkstra最短路算法",{"0":{"3":1},"1":{"3":1},"2":{"3":1},"4":{"3":1}}],["dis",{"2":{"3":21}}],["解法",{"2":{"7":1,"12":2},"4":{"7":1,"12":2}}],["解释",{"2":{"3":1},"4":{"3":1}}],["并用队列维护",{"2":{"19":1}}],["并且不是整数",{"2":{"7":1}}],["并加入",{"2":{"3":1}}],["问期望得分是多少",{"2":{"7":1}}],["已经包含",{"2":{"9":1}}],["已经访问的点是已经确定了最短路的点",{"2":{"3":1}}],["已知第",{"2":{"7":1}}],["次点击的成功率是",{"2":{"7":1}}],["次点击",{"2":{"7":1}}],["输入",{"2":{"7":1,"12":1,"23":1}}],["君觉得",{"2":{"7":1}}],["君并不喜欢",{"2":{"7":1}}],["替换为",{"2":{"6":1,"25":1}}],["无关",{"2":{"6":1}}],["无负权边",{"2":{"3":1}}],["与",{"2":{"6":1,"20":1}}],["期望值的递推式",{"2":{"6":1},"4":{"6":1}}],["长度的递推式",{"2":{"6":1},"4":{"6":1}}],["位命中的概率",{"2":{"6":1}}],["位是否命中",{"2":{"6":1}}],["往前的连续",{"2":{"6":1}}],["随机变量",{"2":{"6":2}}],["定义符号",{"2":{"12":1}}],["定义",{"2":{"6":1,"12":1},"4":{"6":1}}],["定义矩阵运算",{"2":{"4":1}}],["洛谷p1654",{"0":{"6":1},"1":{"6":1},"2":{"6":1},"4":{"6":1}}],["明年高三的时候希望能考好一点吧",{"2":{"5":1}}],["大寄特寄",{"2":{"5":1}}],["总结",{"2":{"5":1,"29":1},"4":{"5":1,"29":1}}],["写个暴力然后就不管了",{"2":{"5":1}}],["写了个tarjan缩点和链的情况",{"2":{"5":1}}],["874d8b8e340f75575caa",{"0":{"57":1},"1":{"57":1}}],["8",{"2":{"5":1,"29":1},"4":{"5":1}}],["预计拿20",{"2":{"5":1}}],["$g",{"4":{"12":1}}],["$g$中所有结点和剩余容量大于",{"4":{"12":1}}],["$0$",{"4":{"12":1}}],["$i$",{"4":{"9":1}}],["$p<i<p+lsb",{"4":{"9":1}}],["$bit",{"4":{"9":4}}],["$",{"2":{"5":1},"4":{"9":5}}],["事后发现$",{"2":{"5":1}}],["其实也不是很难",{"2":{"29":1}}],["其实是增广路算法",{"0":{"13":1},"1":{"13":1},"2":{"13":2},"4":{"13":2}}],["其实我只要再做个前缀和应该就能100了",{"2":{"5":1}}],["其中不动点为复数的情况比较有意思",{"2":{"26":1}}],["其中对于所有",{"2":{"26":1}}],["其中有两个特殊点",{"2":{"12":1}}],["其中",{"2":{"8":2,"9":2,"12":3,"14":1,"19":1,"20":1,"22":2,"26":1}}],["其余位置都是",{"2":{"4":2}}],["其余点的",{"2":{"3":1}}],["不怎么困",{"2":{"29":1}}],["不能拿满分",{"2":{"28":1}}],["不是常数列",{"2":{"26":1}}],["不是全为",{"2":{"26":1}}],["不是最大流",{"2":{"12":1}}],["不动点法求数列通项",{"0":{"26":1},"1":{"26":1},"2":{"26":1},"4":{"26":1}}],["不相连的几个环圈",{"2":{"25":1}}],["不降就是普通的决策单调性",{"2":{"19":1}}],["不变时",{"2":{"14":1}}],["不停找增广路",{"2":{"13":1}}],["不停地找增广路径",{"2":{"12":1}}],["不在同一阵营的惩罚",{"2":{"12":1}}],["不在一起要消耗",{"2":{"12":1}}],["不放",{"2":{"12":1}}],["不可达的",{"2":{"12":1}}],["不可达点的割",{"2":{"12":1}}],["不包含",{"2":{"9":2},"4":{"9":1}}],["不难发现",{"2":{"9":2}}],["不会写",{"2":{"5":1}}],["不够过1000",{"2":{"5":1}}],["不过还是有缓慢的进展的",{"2":{"29":1}}],["不过它是怎么推导出来的我还没有想通",{"2":{"10":1}}],["不过在实际情况中",{"2":{"8":1}}],["不过",{"2":{"3":1}}],["结尾的可消去子序列的数量",{"2":{"28":1}}],["结果就是",{"2":{"24":1}}],["结果存在g数组里面",{"2":{"4":1}}],["结论",{"2":{"3":1},"4":{"3":1}}],["计算f",{"2":{"16":2}}],["计算走恰好nstep的最短路",{"2":{"4":1}}],["计算中点",{"2":{"1":1}}],["否则是",{"2":{"28":1}}],["否则就在第一个不能整块更新的块里二分",{"2":{"19":1}}],["否则要么路径不是极大的",{"2":{"13":1}}],["否则",{"2":{"12":1,"28":2}}],["否则f",{"2":{"4":1}}],["否则左区间比右区间长度多1",{"2":{"1":1}}],["否则左区间比右区间长度小1",{"2":{"1":1}}],["步的最短路径",{"2":{"4":1}}],["走",{"2":{"4":1}}],["恰好",{"2":{"4":1}}],["则",{"2":{"4":1,"9":2,"19":1,"29":1}}],["若对所有",{"2":{"19":1}}],["若这个",{"2":{"12":1}}],["若",{"2":{"4":1,"22":1,"28":1}}],["表示当前栈为",{"2":{"28":1}}],["表示到",{"2":{"28":1}}],["表示不存在",{"2":{"28":1}}],["表示集合的某个性质",{"2":{"24":1}}],["表示使得",{"2":{"28":1}}],["表示使",{"2":{"20":1}}],["表示右侧的点匹配上了左侧的哪个点",{"2":{"13":1}}],["表示右侧的点在这轮寻找增广路的时候有没有被访问过",{"2":{"13":1}}],["表示第",{"2":{"6":2}}],["表示",{"2":{"4":1,"6":1,"8":1,"9":1,"12":1,"19":2,"28":1}}],["表示从i到j恰好走2^p步的最短路",{"2":{"4":1}}],["表示从结点",{"2":{"4":1}}],["表示从",{"2":{"4":1,"6":1}}],["单位元变成除了对角线上是",{"2":{"4":1}}],["单位元是除了对角线上是",{"2":{"4":1}}],["单源多汇最短路",{"2":{"3":1}}],["倍增floyd",{"2":{"4":1},"4":{"4":1}}],["favicon",{"0":{"88":1},"1":{"88":1}}],["false",{"2":{"12":1,"13":1}}],["ffkill",{"0":{"34":1},"1":{"34":1}}],["fonts",{"0":{"44":1,"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"52":1,"53":1,"54":1,"55":1,"56":1,"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["fox",{"2":{"23":1}}],["ford",{"2":{"12":3},"4":{"12":1}}],["file",{"0":{"80":1},"1":{"80":1}}],["files",{"2":{"23":1}}],["find",{"2":{"13":3}}],["fwrite",{"2":{"16":1,"17":1}}],["flusher",{"2":{"16":3,"17":3}}],["flush",{"2":{"16":4,"17":4}}],["flow",{"0":{"31":1},"1":{"31":1},"2":{"12":9},"4":{"12":1}}],["floyd",{"2":{"4":1},"4":{"4":1}}],["floyd和倍增floyd",{"0":{"4":1},"1":{"4":1},"2":{"4":1},"4":{"4":1}}],["fraktur",{"0":{"71":1,"72":1},"1":{"71":1,"72":1}}],["fread",{"2":{"16":1,"17":1}}],["front",{"2":{"12":2}}],["f$",{"4":{"12":1}}],["fulkerson",{"2":{"12":3},"4":{"12":1}}],["f",{"2":{"4":17,"7":5,"12":5,"16":24,"17":4,"19":9,"20":12}}],["json",{"0":{"94":1}}],["js",{"0":{"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"89":1}}],["jpeg",{"0":{"41":1,"42":1}}],["ji",{"2":{"23":3}}],["jiang",{"2":{"23":1}}],["jekyll有时候会把latex公式里的一些符号当成markdown的符号处理掉",{"2":{"11":1}}],["j",{"2":{"4":23,"7":17,"16":35,"19":4,"20":13,"23":1}}],["kr",{"2":{"20":2}}],["kl",{"2":{"20":2}}],["knuth",{"2":{"20":1}}],["konig定理",{"2":{"13":2},"4":{"13":1}}],["konig定理和匈牙利算法",{"0":{"13":1},"1":{"13":1},"2":{"13":1},"4":{"13":1}}],["karp~~动能算法~~",{"4":{"12":1}}],["karp",{"2":{"12":1}}],["killer",{"2":{"12":1}}],["k=2n",{"2":{"5":1}}],["k",{"2":{"4":15,"16":11,"20":9,"22":1}}],["转移方程",{"2":{"4":1}}],["到超级汇的边权为",{"2":{"12":1}}],["到结点",{"2":{"4":1}}],["到",{"2":{"4":1,"9":2,"12":1,"14":1,"19":2,"20":1,"21":1,"28":1,"29":3}}],["和解决",{"2":{"22":1}}],["和m是匹配边的集合",{"2":{"13":1}}],["和流",{"2":{"12":1}}],["和汇点",{"2":{"12":1}}],["和快速幂一样",{"2":{"4":1}}],["和",{"2":{"4":1,"7":1,"10":1,"12":4,"19":1,"20":1,"28":1}}],["号结点的最短路径",{"2":{"4":1}}],["号结点只经过",{"2":{"4":1}}],["号结点到",{"2":{"4":1}}],["令一个像素点在亮背景下显示颜色",{"2":{"27":1}}],["令d为m与m",{"2":{"13":1}}],["令",{"2":{"4":2,"6":1,"8":1,"19":2,"20":1,"24":1,"28":3}}],["传递闭包",{"2":{"4":1}}],["修改之后能用来计算连通性",{"2":{"4":1}}],["能走到",{"2":{"29":3}}],["能解决没有负环的图上的多源多汇的最短",{"2":{"4":1}}],["能平分就平分",{"2":{"1":2}}],["1e9",{"2":{"28":1}}],["1e5",{"2":{"16":1}}],["131",{"2":{"28":1}}],["14",{"0":{"22":1},"1":{"22":1},"2":{"22":1},"4":{"22":1}}],["1维dp四边形不等式优化",{"0":{"19":1},"1":{"19":1},"2":{"19":1},"4":{"19":1}}],["19更新",{"2":{"15":1}}],["18",{"0":{"14":1},"1":{"14":1},"2":{"14":1},"4":{"14":1}}],["1秒可以处理上万个节点的稀疏图",{"2":{"12":2}}],["104544760",{"2":{"26":1}}],["10",{"0":{"13":1,"18":1},"1":{"13":1,"18":1},"2":{"13":1,"16":3,"17":3,"18":1,"28":1},"4":{"13":1,"18":1}}],["1020",{"2":{"7":4}}],["100+100+0+0=200",{"2":{"29":1}}],["100020",{"2":{"7":1}}],["1000000007",{"2":{"7":2}}],["100",{"2":{"5":4},"4":{"5":4}}],["17ae32f754658e2e5a25584cb5877eeb",{"2":{"18":1}}],["17",{"0":{"10":1,"23":1,"26":1},"1":{"10":1,"23":1,"26":1},"2":{"7":1,"10":1,"23":1,"26":1},"4":{"10":1,"23":1,"26":1}}],["151",{"2":{"28":1}}],["15",{"0":{"6":1,"19":1},"1":{"6":1,"19":1},"2":{"6":1,"16":1,"17":1,"19":1},"4":{"6":1,"19":1}}],["120",{"2":{"7":1}}],["12",{"0":{"5":1,"6":1,"7":1,"24":1,"29":1},"1":{"5":1,"6":1,"7":1,"24":1,"29":1},"2":{"5":1,"6":1,"7":1,"10":1,"24":1,"29":2},"4":{"5":1,"6":1,"7":1,"24":1,"29":1}}],["1",{"0":{"41":1},"1":{"41":1},"2":{"3":2,"4":17,"7":11,"12":9,"13":2,"16":43,"17":7,"19":15,"20":12,"26":1,"28":29},"4":{"4":1,"12":1,"26":1}}],["11",{"0":{"1":1,"2":1,"3":1,"4":1},"1":{"1":1,"2":1,"3":1,"4":1},"2":{"1":1,"2":1,"3":1,"4":1,"23":1},"4":{"1":1,"2":1,"3":1,"4":1}}],["ico",{"0":{"88":1}}],["icon",{"2":{"18":1}}],["iq",{"2":{"28":3}}],["i+1",{"2":{"28":1}}],["ib",{"2":{"16":4}}],["ibuf",{"2":{"16":3,"17":3}}],["ia",{"2":{"16":5}}],["ide",{"2":{"23":2}}],["id",{"2":{"16":11}}],["i",{"2":{"16":4,"17":4}}],["italic",{"0":{"61":1,"62":1,"75":1},"1":{"61":1,"62":1,"75":1}}],["it",{"2":{"16":4,"17":4}}],["is",{"2":{"16":6,"17":6}}],["io",{"2":{"16":5,"17":5}}],["inv",{"0":{"40":1},"1":{"40":1}}],["inequality",{"2":{"20":1}}],["in2",{"2":{"16":3}}],["in1",{"2":{"16":3}}],["init",{"2":{"16":2}}],["input",{"2":{"16":1,"17":1,"28":2}}],["inline",{"2":{"16":9,"17":4}}],["include",{"2":{"7":1,"16":1,"28":2}}],["info",{"2":{"19":4}}],["inf",{"2":{"3":1,"12":2}}],["integer",{"2":{"16":2,"17":2}}],["int",{"2":{"2":1,"3":14,"4":12,"7":8,"12":28,"13":7,"16":46,"17":2,"19":13,"20":14,"28":24}}],["iv",{"2":{"3":3}}],["+=",{"2":{"7":3,"12":5,"13":1,"16":8,"28":6}}],["++",{"2":{"3":2,"4":12,"7":5,"12":1,"13":1,"16":27,"17":4,"19":4,"20":7,"28":6}}],["+",{"2":{"3":4,"4":3,"7":2,"12":2,"16":25,"17":5,"19":5,"20":4,"28":18}}],["css",{"0":{"90":1,"91":1,"92":1,"93":1}}],["csp",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["cbe0ae49c52c920fd563",{"0":{"50":1},"1":{"50":1}}],["cb10ffd7684cd9836a05",{"0":{"48":1},"1":{"48":1}}],["c8ba52b05a9ef10f4758",{"0":{"47":1},"1":{"47":1}}],["cin",{"2":{"28":1}}],["clear",{"2":{"28":1}}],["class",{"2":{"16":2,"17":2}}],["ccf版缩小了值域",{"2":{"28":1}}],["cf",{"2":{"28":1}}],["cycle",{"2":{"25":1}}],["cheng",{"2":{"23":1}}],["char",{"2":{"16":2,"17":2,"28":1}}],["ctrl+shift+a调用",{"2":{"23":1}}],["c++快捷方式",{"2":{"23":1}}],["c++翻新",{"0":{"23":1},"1":{"23":1},"2":{"23":1},"4":{"23":1}}],["c++",{"2":{"18":1,"23":7},"4":{"23":1}}],["cph",{"2":{"18":1}}],["cap",{"0":{"30":1},"1":{"30":1}}],["capacity",{"2":{"12":2},"4":{"12":1}}],["calligraphic",{"0":{"69":1,"70":1},"1":{"69":1,"70":1}}],["call",{"2":{"16":1,"17":1}}],["cn",{"2":{"16":1,"23":1}}],["cur",{"2":{"12":4}}],["current",{"2":{"12":1}}],["cout",{"2":{"28":2}}],["coder114514",{"2":{"18":2}}],["code",{"2":{"18":1}}],["conditions",{"2":{"25":1}}],["const",{"2":{"16":4,"17":1,"28":3}}],["continue",{"2":{"3":1,"4":1,"12":5,"13":1,"19":1}}],["competitive",{"2":{"18":1}}],["com",{"2":{"16":1,"18":2,"23":2,"26":2}}],["copy",{"2":{"3":1,"4":2,"7":1,"12":2,"13":1,"16":1,"17":1,"19":1,"20":1,"28":3}}],["c",{"2":{"3":8,"12":15,"16":10,"17":10,"18":1,"23":1,"28":5}}],["nq",{"2":{"28":3}}],["nrp",{"2":{"16":6}}],["nb",{"2":{"16":6}}],["negative",{"2":{"25":1}}],["need",{"2":{"16":1,"17":1}}],["network",{"2":{"12":4},"4":{"12":3}}],["noip2023退役记",{"0":{"29":1},"1":{"29":1},"2":{"29":1},"4":{"29":1}}],["noip2022游寄",{"0":{"5":1},"1":{"5":1},"2":{"5":1,"29":1},"4":{"5":1}}],["no",{"2":{"16":1,"17":1}}],["nl",{"2":{"13":2}}],["n方阵",{"2":{"12":1}}],["n的方格里",{"2":{"12":1}}],["namespace",{"2":{"7":1,"16":2,"17":1,"28":2}}],["nstep",{"2":{"4":3}}],["n",{"2":{"3":2,"4":3,"7":4,"12":3,"16":26,"19":8,"20":9,"28":15}}],["nxta",{"2":{"28":9}}],["nxt",{"2":{"3":2,"12":3,"13":1,"28":19}}],["nv",{"2":{"3":2,"4":7,"12":2,"13":2}}],["h2",{"2":{"28":10}}],["h1",{"2":{"28":10}}],["hua",{"2":{"23":1}}],["hungarian",{"2":{"13":1}}],["helper",{"2":{"18":1}}],["https",{"2":{"16":1,"18":2,"23":2,"26":2}}],["html",{"0":{"0":1,"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":1,"29":1,"80":2}}],["h>",{"2":{"7":1,"16":1,"28":2}}],["hd",{"2":{"3":2,"12":3,"13":1}}],["tinycolor",{"0":{"85":1},"1":{"85":1}}],["tree",{"0":{"80":1},"1":{"80":1}}],["true",{"2":{"3":2,"12":1,"13":2}}],["typewriter",{"0":{"77":1},"1":{"77":1}}],["typedef",{"2":{"3":1,"16":1,"28":1}}],["ttf",{"0":{"52":1,"53":1,"54":1,"55":1}}],["tabout",{"2":{"18":1}}],["template",{"2":{"16":2,"17":2}}],["theme",{"2":{"18":1}}],["the",{"2":{"16":2,"17":2}}],["theorem",{"2":{"13":1,"22":1},"4":{"13":1,"22":1}}],["t",{"2":{"12":8}}],["t4",{"2":{"5":1,"28":1,"29":2},"4":{"5":1}}],["t3",{"2":{"5":1,"28":1,"29":1},"4":{"5":1}}],["t2",{"2":{"5":1,"28":3,"29":3},"4":{"5":1,"28":1}}],["t1",{"2":{"5":1,"28":1,"29":2},"4":{"5":1}}],["to",{"2":{"3":2,"12":4,"13":1,"16":1,"17":1}}],["top",{"2":{"3":1}}],["uac",{"2":{"23":1}}],["up",{"2":{"20":1}}],["using",{"2":{"7":1,"16":4,"17":3,"28":2}}],["u",{"2":{"3":12,"12":17,"13":7}}],["move",{"2":{"28":2}}],["mos",{"2":{"24":1}}],["modified",{"2":{"17":1}}],["mod",{"2":{"7":9,"28":15}}],["mklink",{"2":{"23":1}}],["mid",{"2":{"19":6}}],["minisearch",{"0":{"87":1},"1":{"87":1}}],["min",{"2":{"3":3,"4":5,"12":2,"24":2}}],["metadata",{"0":{"94":1},"1":{"94":1}}],["method",{"2":{"8":1}}],["media",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1,"41":1,"42":1,"57":1,"88":1}}],["mei",{"2":{"23":1}}],["merge",{"2":{"16":3}}],["memcpy",{"2":{"4":1}}],["memset",{"2":{"2":1,"3":4,"4":2,"12":2,"13":1},"4":{"2":1}}],["m",{"2":{"7":7,"13":2,"16":3}}],["map",{"2":{"28":3}}],["math",{"0":{"61":1,"63":1},"1":{"61":1,"63":1}}],["mathjax",{"0":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1},"1":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["material",{"2":{"18":1}}],["match",{"2":{"13":4}}],["manually",{"2":{"16":1,"17":1}}],["main",{"0":{"59":1,"60":1,"62":1,"93":1},"1":{"59":1,"60":1,"62":1,"93":1},"2":{"7":1,"16":1,"28":2}}],["max的相应dp叫做",{"2":{"24":1}}],["maxmatch",{"2":{"13":3}}],["maxflow",{"2":{"12":6}}],["max",{"2":{"4":2,"24":2}}],["make",{"2":{"3":2,"28":3}}],["qi",{"2":{"23":1}}],["qr",{"2":{"16":4,"17":4}}],["question",{"2":{"23":1,"26":1}}],["queue",{"2":{"3":1,"12":2}}],["quadruple",{"2":{"20":1}}],["qu",{"2":{"16":3,"17":3}}],["q",{"2":{"3":6,"12":13,"13":2,"19":12,"25":1}}],["==",{"2":{"4":1,"12":2,"16":6,"17":4,"19":1,"28":2}}],["=w",{"2":{"4":1}}],["=infinity",{"2":{"4":1}}],["=",{"2":{"3":20,"4":16,"7":19,"12":33,"13":7,"16":74,"17":18,"19":18,"20":14,"28":37}}],["variable",{"0":{"92":1},"1":{"92":1}}],["val",{"2":{"19":2}}],["view",{"0":{"82":1},"1":{"82":1}}],["vis",{"2":{"3":9}}],["vscode配置",{"0":{"18":1},"1":{"18":1},"2":{"18":1},"4":{"18":1}}],["vst",{"2":{"13":5}}],["v",{"2":{"3":8,"12":13,"13":6,"20":6}}],["vector",{"0":{"78":1,"79":1},"1":{"78":1,"79":1},"2":{"3":1}}],["void",{"2":{"3":2,"16":7,"17":4,"19":1,"20":1,"28":2}}],["b5f0f109bc88052d4000",{"0":{"49":1},"1":{"49":1}}],["bolditalic",{"0":{"63":1},"1":{"63":1}}],["bold",{"0":{"60":1,"70":1,"72":1,"74":1,"79":1},"1":{"60":1,"70":1,"72":1,"74":1,"79":1}}],["boardnet",{"0":{"39":1},"1":{"39":1}}],["board",{"0":{"38":1},"1":{"38":1}}],["bool",{"2":{"3":1,"12":2,"13":2}}],["back",{"2":{"28":5}}],["b2",{"2":{"28":2}}],["b1",{"2":{"28":2}}],["b图偏暗",{"2":{"27":1}}],["binflow",{"0":{"37":1},"1":{"37":1}}],["bin",{"0":{"36":1},"1":{"36":1}}],["bian",{"2":{"23":1}}],["bit",{"2":{"16":4}}],["br",{"2":{"16":7}}],["bloodshed",{"2":{"23":1}}],["blog",{"0":{"0":1,"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":1,"29":1},"2":{"23":1}}],["bl",{"2":{"16":10}}],["bsize",{"2":{"16":4}}],["bel",{"2":{"16":10}}],["berge",{"2":{"13":1},"4":{"13":1}}],["b",{"2":{"7":8,"16":7}}],["bfs+dfs每次尝试寻找多条增广路径",{"2":{"12":1},"4":{"12":1}}],["bfs",{"2":{"12":4}}],["bf",{"2":{"3":1}}],["svg",{"0":{"57":1}}],["sansserif",{"0":{"73":1,"74":1,"75":1},"1":{"73":1,"74":1,"75":1}}],["sat",{"2":{"29":2}}],["sap",{"2":{"12":1}}],["ssp",{"2":{"25":1}}],["shen",{"2":{"23":1}}],["shortest",{"2":{"12":1,"25":1}}],["sky",{"2":{"23":1}}],["skew",{"2":{"12":1}}],["speed",{"2":{"20":1}}],["search",{"2":{"19":2}}],["second",{"2":{"3":1}}],["sos",{"2":{"24":2}}],["solve",{"2":{"16":2,"28":2}}],["sort",{"2":{"16":1}}],["source",{"2":{"12":1}}],["successive",{"2":{"25":1}}],["subsets",{"2":{"24":2}}],["supersets",{"2":{"24":2}}],["sufficiency",{"2":{"22":1},"4":{"22":1}}],["suf",{"2":{"16":4}}],["sum",{"2":{"12":3,"16":3,"24":1}}],["styles",{"0":{"90":1,"91":1,"92":2,"93":2},"1":{"92":1,"93":1}}],["st",{"2":{"28":4}}],["stk",{"2":{"28":13}}],["string",{"2":{"28":2}}],["struct",{"2":{"16":1,"17":1,"19":2,"20":1}}],["stdout",{"2":{"16":1,"17":1}}],["stdin",{"2":{"16":1,"17":1}}],["std",{"2":{"7":1,"16":1,"28":2}}],["stdc++",{"2":{"7":1,"16":1,"28":2}}],["script",{"0":{"76":1},"1":{"76":1}}],["scripts",{"0":{"43":1,"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"89":1}}],["sc和dt两条边可看作",{"2":{"12":1}}],["scanf",{"2":{"7":2,"28":3}}],["symmetry",{"2":{"12":1}}],["signed",{"2":{"16":2,"17":2}}],["size4",{"0":{"67":1},"1":{"67":1}}],["size3",{"0":{"66":1},"1":{"66":1}}],["size2",{"0":{"65":1},"1":{"65":1}}],["size1",{"0":{"64":1},"1":{"64":1}}],["size",{"2":{"16":5,"17":5,"28":4}}],["sizeof",{"2":{"3":4,"4":3,"12":2,"13":1}}],["sink",{"2":{"12":1}}],["s",{"0":{"28":1},"1":{"28":1},"2":{"3":4,"7":6,"8":1,"12":7,"13":1,"28":5,"29":1},"4":{"13":1,"28":1}}],["plugins",{"0":{"91":1},"1":{"91":1}}],["pixi",{"0":{"86":1},"1":{"86":1}}],["pii",{"2":{"3":4}}],["p2",{"2":{"28":7}}],["p1",{"2":{"28":7}}],["png",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1},"2":{"27":1}}],["pos",{"2":{"19":5}}],["pop",{"2":{"3":1,"12":2,"28":1}}],["psq",{"2":{"16":3}}],["putc",{"2":{"16":6,"17":5}}],["putchar",{"2":{"16":1,"17":1}}],["push",{"2":{"3":2,"12":4,"28":1}}],["p5046",{"2":{"16":1}}],["programming",{"2":{"18":1}}],["problem",{"2":{"16":1}}],["pre",{"2":{"12":9,"16":6,"19":5}}],["print",{"2":{"16":5,"17":4}}],["printf",{"2":{"7":1,"19":1,"20":1}}],["priority",{"2":{"3":1}}],["part",{"2":{"16":1,"17":1}}],["path",{"2":{"12":1,"13":2,"25":1}}],["pair",{"2":{"3":3,"28":4}}],["p+lsb",{"4":{"9":1}}],["p",{"2":{"4":13,"7":6,"16":4,"26":1},"4":{"9":4}}],[">=",{"2":{"16":3,"17":1,"28":2}}],[">>",{"2":{"3":1,"28":2}}],[">",{"2":{"3":4,"7":1,"12":2,"16":5,"17":3,"19":1,"28":3}}],["<bits",{"2":{"7":1,"16":1,"28":2}}],["<<",{"2":{"4":3,"16":1,"17":1,"20":1,"28":4}}],["<=",{"2":{"3":1,"4":12,"7":5,"12":1,"13":1,"16":22,"17":1,"19":4,"20":6,"28":5}}],["<",{"2":{"3":6,"12":2,"16":9,"17":4,"19":3,"20":1,"28":4}}],["稠密图中",{"2":{"3":1}}],["稀疏图中",{"2":{"3":1}}],["的就是答案",{"2":{"29":1}}],["的单向边",{"2":{"29":1}}],["的区间是可以消去的",{"2":{"28":1}}],["的常数列",{"2":{"26":1}}],["的反向路径",{"2":{"25":1}}],["的一个解",{"2":{"22":1}}],["的解",{"2":{"22":1}}],["的最小的",{"2":{"28":1}}],["的最小值",{"2":{"22":1}}],["的最优解",{"2":{"19":1}}],["的情况下使",{"2":{"22":1}}],["的曲线下方面积",{"2":{"21":1}}],["的决策",{"2":{"19":1}}],["的时候",{"2":{"14":1}}],["的时候不断",{"2":{"9":1}}],["的模型",{"2":{"12":1}}],["的双向边",{"2":{"12":1}}],["的边的数量",{"2":{"29":1}}],["的边权为",{"2":{"12":1}}],["的边和反向边构成的图",{"2":{"12":1},"4":{"12":1}}],["的点对",{"2":{"12":1}}],["的路径",{"2":{"12":1}}],["的划分",{"2":{"12":1}}],["的对称差",{"2":{"13":1}}],["的对",{"2":{"12":1}}],["的层次图",{"2":{"12":1}}],["的映射",{"2":{"12":2}}],["的结果即可",{"2":{"7":1}}],["的长度",{"2":{"6":1}}],["的分数",{"2":{"6":1}}],["的矩阵",{"2":{"4":2}}],["的",{"2":{"3":1,"8":1,"9":1,"12":1,"13":1,"23":1,"28":1},"4":{"9":1}}],["的复杂度分析",{"2":{"3":1}}],["因为可能中间反转了奇数次",{"2":{"29":1}}],["因为m",{"2":{"13":1}}],["因为d中每个节点最多能连接两条边",{"2":{"13":1}}],["因为增广路长度肯定是奇数",{"2":{"13":1}}],["因为以它们为起点的增广路的终点一定在左侧点中",{"2":{"13":1}}],["因为不会新增非匹配点",{"2":{"13":1}}],["因为它变成匹配点了",{"2":{"13":1}}],["因为匹配边没有共同的端点",{"2":{"13":1}}],["因为我们要最小割",{"2":{"12":1}}],["因为我们可以提前知道哪些路径走下去肯定到不了终点",{"2":{"12":1}}],["因为奇格子都偶格子连了个无限大的边",{"2":{"12":1}}],["因为最大总和等于所有数的和减掉最小的不选的总和",{"2":{"12":1}}],["因为得分可能很大",{"2":{"7":1}}],["因为满足结合律所以无论怎么加括号结果都是一样的",{"2":{"4":1}}],["因为第一维被滚动掉了",{"2":{"4":1}}],["因为",{"2":{"3":1,"6":1,"25":3}}],["个不放",{"2":{"12":1}}],["个不同的盒子中",{"2":{"10":1}}],["个不同球放进",{"2":{"10":1}}],["个物品要放入集合",{"2":{"12":1}}],["个",{"2":{"3":1}}],["堆",{"2":{"3":1},"4":{"3":1}}],["操作5总复杂度为",{"2":{"3":2}}],["操作5的总复杂度为",{"2":{"3":1}}],["操作4总复杂度为",{"2":{"3":1}}],["操作3总复杂度为",{"2":{"3":2}}],["操作3的总复杂度为",{"2":{"3":1}}],["暴力复杂度反而更优",{"2":{"3":1}}],["暴力",{"2":{"3":1},"4":{"3":1}}],["了",{"2":{"3":1,"20":1,"29":1}}],["也有边",{"2":{"29":1}}],["也有关",{"2":{"20":1}}],["也可能还会出现与",{"2":{"25":1}}],["也是原问题",{"2":{"22":1}}],["也是因为这个",{"2":{"13":1}}],["也是",{"2":{"12":1}}],["也不能让",{"2":{"3":1}}],["也就是把ek算法中的bfs换成spfa",{"2":{"25":1}}],["也就是找不到终点是非匹配点的交错路",{"2":{"13":1}}],["也就是",{"2":{"1":1}}],["所谓的幻影坦克是一类图片",{"2":{"27":1}}],["所以一致性还是能满足的",{"2":{"29":1}}],["所以引入",{"2":{"28":1}}],["所以幻影坦克一般都是灰度图",{"2":{"27":1}}],["所以它无法正常工作",{"2":{"23":1}}],["所以它现在用它可能有一些问题",{"2":{"23":1}}],["所以我们需要翻新它",{"2":{"23":1}}],["所以我们考虑如何用最小割建模最小的不选的总和",{"2":{"12":1}}],["所以如果能从无限制问题中的结果得到有限制问题的结果",{"2":{"22":1}}],["所以结果是",{"2":{"21":1}}],["所以叫四边形不等式优化",{"2":{"19":1}}],["所以这段时间很多图片都不会显示",{"2":{"15":1}}],["所以这个点的最短路确定就是",{"2":{"3":1}}],["所以d中一定存在某个极大的分量其中在m",{"2":{"13":1}}],["所以选出来了最大匹配数个点",{"2":{"13":1}}],["所以所有点覆盖大于等于最大匹配",{"2":{"13":1}}],["所以不能通过将",{"2":{"12":1}}],["所以在",{"2":{"9":2}}],["所以累积误差是",{"2":{"8":1}}],["所以",{"2":{"8":1,"12":2,"25":3}}],["所以可以直接把之前的",{"2":{"6":1}}],["所以队内元素有",{"2":{"3":1}}],["所以能让它",{"2":{"3":1}}],["所有第三种边都被覆盖",{"2":{"13":1}}],["所有匹配边肯定被覆盖",{"2":{"13":1}}],["所有出边进行松弛操作",{"2":{"3":1}}],["所有点标记为未访问",{"2":{"3":1}}],["未访问的点是有待确认的点",{"2":{"3":1}}],["适用范围",{"2":{"3":1},"4":{"3":1}}],["对上式两端取倒数",{"2":{"26":1}}],["对序列切割问题",{"2":{"19":1}}],["对称差定义",{"2":{"13":1}}],["对他们来说",{"2":{"12":1}}],["对残量图进行分层得到层次图",{"2":{"12":1}}],["对比",{"2":{"10":1}}],["对于某个集合",{"2":{"24":1}}],["对于问题",{"2":{"22":1}}],["对于区间dp问题",{"2":{"20":1}}],["对于剩下的匹配边选它们的右端点",{"2":{"13":1}}],["对于只有左端参与匹配的非匹配边",{"2":{"13":1}}],["对于偶格子",{"2":{"12":1}}],["对于所有",{"2":{"20":2}}],["对于所有满足",{"2":{"12":1}}],["对于所有的",{"2":{"8":2}}],["对于任意的割",{"2":{"12":1}}],["对于一个奇格子",{"2":{"12":1}}],["对于一个未访问的点中",{"2":{"3":1}}],["对于一段长度为",{"2":{"7":1}}],["对算法正确性的说明",{"2":{"7":1}}],["对不同$f$的复杂度分析",{"4":{"3":1}}],["对不同",{"2":{"3":1}}],["对",{"2":{"3":1,"12":1},"4":{"12":1}}],["标记为已访问并把它从",{"2":{"3":1}}],["把端点被选中的边去掉",{"2":{"13":1}}],["把",{"2":{"3":1,"10":1,"23":1,"25":1}}],["中途手画了不少图",{"2":{"29":1}}],["中",{"2":{"25":1}}],["中的边是不在m中的",{"2":{"13":1}}],["中的边结束的极大的路径",{"2":{"13":1}}],["中的边开始",{"2":{"13":1}}],["中的边的数量比在m中的边的数量多",{"2":{"13":1}}],["中的边的数量是相等的",{"2":{"13":1}}],["中所有结点和剩余容量大于",{"2":{"12":1}}],["中间的盒子可以是空盒的时候的方案数",{"2":{"10":1}}],["中修改和插入",{"2":{"3":1}}],["中删除",{"2":{"3":2}}],["中查询",{"2":{"3":1}}],["中选出",{"2":{"3":1}}],["记为",{"2":{"3":1,"26":1}}],["从偶格子向它周围的四个奇格子连边",{"2":{"12":1}}],["从奇格子向汇点连边",{"2":{"12":1}}],["从源点向偶格子连边",{"2":{"12":1}}],["从中取出若干数",{"2":{"12":1}}],["从超级汇向每个不要睡觉的小朋友连一条权值为1的边",{"2":{"12":1}}],["从而",{"2":{"9":1}}],["从",{"2":{"3":1,"28":1}}],["52ac8f3034507f1d9e53",{"0":{"54":1},"1":{"54":1}}],["535a6cf662596b3bd6a6",{"0":{"51":1},"1":{"51":1}}],["566595014",{"2":{"26":1}}],["55",{"2":{"16":1,"17":1}}],["570000004",{"2":{"7":1}}],["5",{"2":{"3":1,"23":1}}],["初始状态",{"2":{"4":1}}],["初始化",{"2":{"3":1}}],["初值",{"2":{"2":1,"4":1},"4":{"2":1}}],["负无穷",{"2":{"2":1}}],["正解",{"2":{"28":1}}],["正解做法",{"2":{"10":1},"4":{"10":1}}],["正方向是显然的",{"2":{"25":1}}],["正方向是很显然的",{"2":{"13":1}}],["正确性由",{"2":{"19":1}}],["正无穷",{"2":{"2":1}}],["正常",{"2":{"1":1}}],["最优的",{"2":{"20":1}}],["最长路就是把",{"2":{"4":1}}],["最长路问题",{"2":{"4":2}}],["最多是",{"2":{"3":1}}],["最小费用最大流",{"0":{"25":1},"1":{"25":1},"2":{"25":1},"4":{"25":1}}],["最小黑白生成树",{"2":{"22":1}}],["最小化",{"2":{"22":3}}],["最小点覆盖",{"2":{"13":1}}],["最小割另一个等价的定义是最小的通过删边使源点到汇点不再连通的删去的边的权值和",{"2":{"12":1}}],["最小割定义为大小最小的割",{"2":{"12":1}}],["最小割",{"2":{"12":1},"4":{"12":1}}],["最小的点",{"2":{"3":1}}],["最小且未访问的点",{"2":{"3":1}}],["最小",{"2":{"2":2}}],["最大化",{"2":{"22":1}}],["最大匹配数等于最小点覆盖",{"2":{"13":1}}],["最大流最小割定理",{"2":{"12":1},"4":{"12":1}}],["最大流就是大小最大的流",{"2":{"12":1}}],["最大流",{"2":{"12":1},"4":{"12":1}}],["最大",{"2":{"2":2}}],["09",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["07",{"0":{"26":1},"1":{"26":1},"2":{"26":1},"4":{"26":1}}],["04",{"0":{"17":1,"22":1,"23":1},"1":{"17":1,"22":1,"23":1},"2":{"17":1,"22":1,"23":1},"4":{"17":1,"22":1,"23":1}}],["03",{"0":{"17":1,"18":1,"19":1,"20":1,"21":1},"1":{"17":1,"18":1,"19":1,"20":1,"21":1},"2":{"17":1,"18":1,"19":1,"20":1,"21":1},"4":{"17":1,"18":1,"19":1,"20":1,"21":1}}],["05b618077343fbbd92b7",{"0":{"55":1},"1":{"55":1}}],["05",{"0":{"11":1,"24":1},"1":{"11":1,"24":1},"2":{"11":1,"24":1},"4":{"11":1,"24":1}}],["02",{"0":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"1":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"2":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"4":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1}}],["08",{"0":{"8":1,"9":1,"12":1,"27":1},"1":{"8":1,"9":1,"12":1,"27":1},"2":{"8":1,"9":1,"12":1,"27":1},"4":{"8":1,"9":1,"12":1,"27":1}}],["01",{"0":{"8":1,"9":1,"10":1},"1":{"8":1,"9":1,"10":1},"2":{"7":1,"8":1,"9":1,"10":1},"4":{"8":1,"9":1,"10":1}}],["06",{"0":{"5":1,"25":1},"1":{"5":1,"25":1},"2":{"5":1,"25":1,"29":1},"4":{"5":1,"25":1}}],["0",{"2":{"3":5,"4":5,"5":2,"7":11,"12":5,"13":2,"16":14,"17":6,"19":1,"20":1,"28":10},"4":{"5":2}}],["0xbf",{"2":{"2":2}}],["0x80",{"2":{"2":3}}],["0xc0",{"2":{"2":6}}],["0x7f",{"2":{"2":3}}],["0x3f",{"2":{"2":6,"3":2,"4":2}}],["00",{"0":{"0":2},"1":{"0":2},"2":{"0":2,"29":1},"4":{"0":2}}],["0000",{"0":{"0":1},"1":{"0":1},"2":{"0":1},"4":{"0":1}}],["估算",{"2":{"2":2}}],["死循环",{"2":{"1":1}}],["global",{"0":{"92":1},"1":{"92":1}}],["graph",{"0":{"43":1,"82":1,"83":1,"84":1,"89":1},"1":{"43":1,"82":1,"83":1,"84":1,"89":1}}],["greater",{"2":{"3":1}}],["github",{"2":{"18":2}}],["gist",{"2":{"18":2}}],["gi",{"2":{"16":7,"17":2}}],["gc",{"2":{"16":4,"17":4}}],["getchar",{"2":{"16":1,"17":1}}],["g",{"2":{"1":1,"4":5}}],["error",{"2":{"18":1}}],["endl",{"2":{"28":2}}],["end",{"2":{"16":1,"17":1}}],["eof",{"2":{"16":1,"17":1}}],["ek",{"2":{"12":1}}],["edmond",{"2":{"12":1},"4":{"12":1}}],["euler",{"2":{"8":1}}],["empty",{"2":{"3":1,"12":2}}],["e",{"2":{"1":1,"3":6,"12":15,"13":4,"25":1}}],["如果多花点时间",{"2":{"29":1}}],["如果有",{"2":{"28":1,"29":1}}],["如果有两个不动点",{"2":{"26":1}}],["如果该元素和栈顶的是相同的",{"2":{"28":1}}],["如果只有一个不动点",{"2":{"26":1}}],["如果一个残量图中没有负环",{"2":{"25":1}}],["如果一个奇格子是",{"2":{"12":1}}],["如果问题",{"2":{"22":1}}],["如果能整个更新",{"2":{"19":1}}],["如果以它为起点存在增广路",{"2":{"13":1}}],["如果我这时候突然又决定把左边割掉",{"2":{"12":1}}],["如果是",{"2":{"12":1}}],["如果每次dfs运气不好都过中间那条边的话",{"2":{"12":1}}],["如果",{"2":{"1":2,"4":1,"12":1,"20":1,"22":1,"26":1,"28":1}}],["如果线段树端点值可以取负数",{"2":{"1":1}}],["线段树处理负数端点值",{"0":{"1":1},"1":{"1":1},"2":{"1":1},"4":{"1":1}}],["2d5198822ab091ce4305",{"0":{"46":1},"1":{"46":1}}],["24",{"0":{"27":1},"1":{"27":1},"2":{"27":1},"4":{"27":1}}],["2758066742",{"2":{"26":1}}],["267249434",{"2":{"23":1}}],["26",{"0":{"21":1},"1":{"21":1},"2":{"21":1},"4":{"21":1}}],["2维dp四边形不等式优化",{"0":{"20":1},"1":{"20":1},"2":{"20":1},"4":{"20":1}}],["21",{"2":{"16":1,"17":1}}],["23",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["2000010",{"2":{"28":2}}],["2023",{"0":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1},"1":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1},"2":{"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":2,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":3},"4":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1}}],["2022",{"0":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1},"1":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1},"2":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"10":1,"29":1},"4":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1}}],["20",{"0":{"7":1,"15":1,"28":1},"1":{"7":1,"15":1,"28":1},"2":{"7":1,"10":1,"15":1,"28":1,"29":1},"4":{"7":1,"15":1,"28":1}}],["25",{"0":{"20":1,"25":1},"1":{"20":1,"25":1},"2":{"5":1,"20":1,"25":1},"4":{"5":1,"20":1,"25":1}}],["2",{"0":{"42":1},"1":{"42":1},"2":{"2":4,"4":1,"5":1,"12":1,"19":2,"26":1,"29":2},"4":{"4":1,"12":1,"26":1}}],["2246716057",{"2":{"23":1}}],["22",{"0":{"1":1,"2":1,"3":1,"4":1},"1":{"1":1,"2":1,"3":1,"4":1},"2":{"1":1,"2":1,"3":1,"4":1},"4":{"1":1,"2":1,"3":1,"4":1}}],["29",{"2":{"0":1}}]],"serializationVersion":2}
\ No newline at end of file
+{"documentCount":95,"nextId":95,"documentIds":{"0":"blog/0000-00-00-目录.html","1":"blog/2022-11-22-线段树处理负数端点值.html","2":"blog/2022-11-22-整数数据范围和memset初值.html","3":"blog/2022-11-22-dijkstra最短路算法.html","4":"blog/2022-11-22-floyd和倍增floyd.html","5":"blog/2022-12-06-noip2022游寄.html","6":"blog/2022-12-15-洛谷p1654-osu.html","7":"blog/2022-12-20-osu拓展.html","8":"blog/2023-01-08-欧拉法的误差分析.html","9":"blog/2023-01-08-树状数组bit正确性的证明.html","10":"blog/2023-01-17-再看osu拓展.html","11":"blog/2023-02-05-latex和markdown冲突.html","12":"blog/2023-02-08-网络流入门.html","13":"blog/2023-02-10-konig定理和匈牙利算法(其实是增广路算法).html","14":"blog/2023-02-18-变质量系统中力与动量的关系.html","15":"blog/2023-02-20-云图床炸了.html","16":"blog/2023-02-23-毒瘤题,纪念一下.html","17":"blog/2023-03-04-快读模版.html","18":"blog/2023-03-10-vscode配置.html","19":"blog/2023-03-15-1维dp四边形不等式优化(决策单调性优化).html","20":"blog/2023-03-25-2维dp四边形不等式优化(决策单调性优化).html","21":"blog/2023-03-26-两道有意思的微积分题目.html","22":"blog/2023-04-14-wqs二分.html","23":"blog/2023-04-17-dev-c++翻新.html","24":"blog/2023-05-12-集合dp.html","25":"blog/2023-06-25-最小费用最大流.html","26":"blog/2023-07-17-不动点法求数列通项.html","27":"blog/2023-08-24-幻影坦克.html","28":"blog/2023-09-20-csp-s-2023-复赛.html","29":"blog/2023-12-02-noip2023退役记.html","30":"lib\\media\\cap.png","31":"lib\\media\\flow.png","32":"lib\\media\\res.png","33":"lib\\media\\aug.png","34":"lib\\media\\ffkill.png","35":"lib\\media\\lvl.png","36":"lib\\media\\bin.png","37":"lib\\media\\binflow.png","38":"lib\\media\\board.png","39":"lib\\media\\boardnet.png","40":"lib\\media\\inv.png","41":"lib\\media\\1.jpeg","42":"lib\\media\\2.jpeg","43":"lib\\scripts\\graph-wasm.wasm","44":"lib\\fonts\\94f2f163d4b698242fef.otf","45":"lib\\fonts\\72505e6a122c6acd5471.woff2","46":"lib\\fonts\\2d5198822ab091ce4305.woff2","47":"lib\\fonts\\c8ba52b05a9ef10f4758.woff2","48":"lib\\fonts\\cb10ffd7684cd9836a05.woff2","49":"lib\\fonts\\b5f0f109bc88052d4000.woff2","50":"lib\\fonts\\cbe0ae49c52c920fd563.woff2","51":"lib\\fonts\\535a6cf662596b3bd6a6.woff2","52":"lib\\fonts\\70cc7ff27245e82ad414.ttf","53":"lib\\fonts\\454577c22304619db035.ttf","54":"lib\\fonts\\52ac8f3034507f1d9e53.ttf","55":"lib\\fonts\\05b618077343fbbd92b7.ttf","56":"lib\\fonts\\4bb6ac751d1c5478ff3a.woff2","57":"lib\\media\\874d8b8e340f75575caa.svg","58":"lib\\fonts\\mathjax_zero.woff","59":"lib\\fonts\\mathjax_main-regular.woff","60":"lib\\fonts\\mathjax_main-bold.woff","61":"lib\\fonts\\mathjax_math-italic.woff","62":"lib\\fonts\\mathjax_main-italic.woff","63":"lib\\fonts\\mathjax_math-bolditalic.woff","64":"lib\\fonts\\mathjax_size1-regular.woff","65":"lib\\fonts\\mathjax_size2-regular.woff","66":"lib\\fonts\\mathjax_size3-regular.woff","67":"lib\\fonts\\mathjax_size4-regular.woff","68":"lib\\fonts\\mathjax_ams-regular.woff","69":"lib\\fonts\\mathjax_calligraphic-regular.woff","70":"lib\\fonts\\mathjax_calligraphic-bold.woff","71":"lib\\fonts\\mathjax_fraktur-regular.woff","72":"lib\\fonts\\mathjax_fraktur-bold.woff","73":"lib\\fonts\\mathjax_sansserif-regular.woff","74":"lib\\fonts\\mathjax_sansserif-bold.woff","75":"lib\\fonts\\mathjax_sansserif-italic.woff","76":"lib\\fonts\\mathjax_script-regular.woff","77":"lib\\fonts\\mathjax_typewriter-regular.woff","78":"lib\\fonts\\mathjax_vector-regular.woff","79":"lib\\fonts\\mathjax_vector-bold.woff","80":"lib\\html\\file-tree.html","81":"lib\\scripts\\webpage.js","82":"lib\\scripts\\graph-view.js","83":"lib\\scripts\\graph-wasm.js","84":"lib\\scripts\\graph-render-worker.js","85":"lib\\scripts\\tinycolor.js","86":"lib\\scripts\\pixi.js","87":"lib\\scripts\\minisearch.js","88":"lib\\media\\favicon.ico","89":"lib\\scripts\\graph-data.js","90":"lib\\styles\\obsidian.css","91":"lib\\styles\\other-plugins.css","92":"lib\\styles\\global-variable-styles.css","93":"lib\\styles\\main-styles.css","94":"lib\\metadata.json"},"fieldIds":{"path":0,"title":1,"content":2,"tags":3,"headers":4},"fieldLength":{"0":[5,3,4,1,3],"1":[6,4,19,1,4],"2":[6,4,22,1,7],"3":[6,4,125,1,13],"4":[6,4,86,1,8],"5":[6,4,31,1,13],"6":[7,5,24,1,9],"7":[6,4,73,1,6],"8":[6,4,26,1,4],"9":[6,4,45,1,20],"10":[6,4,22,1,6],"11":[6,4,11,1,4],"12":[6,4,351,1,51],"13":[7,6,163,1,12],"14":[6,4,28,1,7],"15":[6,4,17,1,4],"16":[7,5,157,1,5],"17":[6,4,82,1,4],"18":[6,4,27,1,5],"19":[7,6,82,1,6],"20":[7,6,72,1,6],"21":[6,4,11,1,6],"22":[6,4,54,1,9],"23":[7,5,85,1,9],"24":[6,4,38,1,4],"25":[6,4,62,1,4],"26":[6,4,64,1,8],"27":[6,4,25,1,4],"28":[8,6,152,1,11],"29":[6,4,97,1,7],"30":[4,1,1,1,1],"31":[4,1,1,1,1],"32":[4,1,1,1,1],"33":[4,1,1,1,1],"34":[4,1,1,1,1],"35":[4,1,1,1,1],"36":[4,1,1,1,1],"37":[4,1,1,1,1],"38":[4,1,1,1,1],"39":[4,1,1,1,1],"40":[4,1,1,1,1],"41":[4,1,1,1,1],"42":[4,1,1,1,1],"43":[4,2,1,1,1],"44":[4,1,1,1,1],"45":[4,1,1,1,1],"46":[4,1,1,1,1],"47":[4,1,1,1,1],"48":[4,1,1,1,1],"49":[4,1,1,1,1],"50":[4,1,1,1,1],"51":[4,1,1,1,1],"52":[4,1,1,1,1],"53":[4,1,1,1,1],"54":[4,1,1,1,1],"55":[4,1,1,1,1],"56":[4,1,1,1,1],"57":[4,1,1,1,1],"58":[5,2,1,1,1],"59":[6,3,1,1,1],"60":[6,3,1,1,1],"61":[6,3,1,1,1],"62":[6,3,1,1,1],"63":[6,3,1,1,1],"64":[6,3,1,1,1],"65":[6,3,1,1,1],"66":[6,3,1,1,1],"67":[6,3,1,1,1],"68":[6,3,1,1,1],"69":[6,3,1,1,1],"70":[6,3,1,1,1],"71":[6,3,1,1,1],"72":[6,3,1,1,1],"73":[6,3,1,1,1],"74":[6,3,1,1,1],"75":[6,3,1,1,1],"76":[6,3,1,1,1],"77":[6,3,1,1,1],"78":[6,3,1,1,1],"79":[6,3,1,1,1],"80":[4,2,1,1,1],"81":[4,1,1,1,1],"82":[5,2,1,1,1],"83":[5,2,1,1,1],"84":[6,3,1,1,1],"85":[4,1,1,1,1],"86":[4,1,1,1,1],"87":[4,1,1,1,1],"88":[4,1,1,1,1],"89":[5,2,1,1,1],"90":[4,1,1,1,1],"91":[5,2,1,1,1],"92":[5,3,1,1,1],"93":[4,2,1,1,1],"94":[3,1,1,1,1]},"averageFieldLength":[5.221052631578947,2.621052631578947,22.31578947368421,1,3.4105263157894736],"storedFields":{"0":{"path":"blog/0000-00-00-目录.html","title":"0000-00-00-目录","tags":[],"headers":["0000-00-00-目录"]},"1":{"path":"blog/2022-11-22-线段树处理负数端点值.html","title":"2022-11-22-线段树处理负数端点值","tags":[],"headers":["2022-11-22-线段树处理负数端点值"]},"2":{"path":"blog/2022-11-22-整数数据范围和memset初值.html","title":"2022-11-22-整数数据范围和memset初值","tags":[],"headers":["2022-11-22-整数数据范围和memset初值","整数数据范围","memset 初值"]},"3":{"path":"blog/2022-11-22-dijkstra最短路算法.html","title":"2022-11-22-Dijkstra最短路算法","tags":[],"headers":["2022-11-22-Dijkstra最短路算法","算法过程","适用范围","解释","对不同$f$的复杂度分析","暴力","堆","优先队列","结论","代码"]},"4":{"path":"blog/2022-11-22-floyd和倍增floyd.html","title":"2022-11-22-Floyd和倍增Floyd","tags":[],"headers":["2022-11-22-Floyd和倍增Floyd","1.Floyd","2.倍增Floyd"]},"5":{"path":"blog/2022-12-06-noip2022游寄.html","title":"2022-12-06-NOIP2022游寄","tags":[],"headers":["2022-12-06-NOIP2022游寄","T1 (25/100)","T2 (0/100)","T3 (0/100)","T4 (8/100)","总结"]},"6":{"path":"blog/2022-12-15-洛谷p1654-osu.html","title":"2022-12-15-洛谷P1654-OSU","tags":[],"headers":["2022-12-15-洛谷P1654-OSU","定义","分数的递推式","长度的递推式","期望值的递推式"]},"7":{"path":"blog/2022-12-20-osu拓展.html","title":"2022-12-20-OSU拓展","tags":[],"headers":["2022-12-20-OSU拓展","题面","解法"]},"8":{"path":"blog/2023-01-08-欧拉法的误差分析.html","title":"2023-01-08-欧拉法的误差分析","tags":[],"headers":["2023-01-08-欧拉法的误差分析"]},"9":{"path":"blog/2023-01-08-树状数组bit正确性的证明.html","title":"2023-01-08-树状数组BIT正确性的证明","tags":[],"headers":["2023-01-08-树状数组BIT正确性的证明","询问","更新","第一步：证明 $bit[p]$ 真包含于 $bit[p+LSB(p)]$","第二部：证明对任意满足 $p<i<p+LSB(p)$ 的 $i$ ， $bit[i]$ 不包含 $bit[p]$"]},"10":{"path":"blog/2023-01-17-再看osu拓展.html","title":"2023-01-17-再看OSU拓展","tags":[],"headers":["2023-01-17-再看OSU拓展","二项式定理做法","正解做法"]},"11":{"path":"blog/2023-02-05-latex和markdown冲突.html","title":"2023-02-05-latex和markdown冲突","tags":[],"headers":["2023-02-05-latex和markdown冲突"]},"12":{"path":"blog/2023-02-08-网络流入门.html","title":"2023-02-08-网络流入门","tags":[],"headers":["2023-02-08-网络流入门","什么是网络流","容量网络（capacity network）：加了容量的网络，上面每条边的权值等于这条边的容量","流量网络（flow network）：加了流量的网络，x/y表示流量/容量","残量网络（residual network）：$G$中所有结点和剩余容量大于 $0$ 的边和反向边构成的图，一般记作 $G_f$","最大流","算法","Ford-Fulkerson: 每次通过dfs找一条增广路径","Edmond-Karp~~动能算法~~: 每次通过bfs找一条增广路径","代码","Dinic: bfs+dfs每次尝试寻找多条增广路径","最小割","最大流最小割定理","应用","1. 二分图最大匹配","2. 对“二选一”类型的问题建模","例题","第一题","解法","第二题","解法","按照集合划分理解","按照割边来理解","常见结构"]},"13":{"path":"blog/2023-02-10-konig定理和匈牙利算法(其实是增广路算法).html","title":"2023-02-10-Konig定理和匈牙利算法(其实是增广路算法)","tags":[],"headers":["2023-02-10-Konig定理和匈牙利算法(其实是增广路算法)","Konig定理","证明：","匈牙利算法 (其实是增广路算法)","代码","Berge's theorem"]},"14":{"path":"blog/2023-02-18-变质量系统中力与动量的关系.html","title":"2023-02-18-变质量系统中力与动量的关系","tags":[],"headers":["2023-02-18-变质量系统中力与动量的关系","证明","例子：火箭方程"]},"15":{"path":"blog/2023-02-20-云图床炸了.html","title":"2023-02-20-云图床炸了","tags":[],"headers":["2023-02-20-云图床炸了"]},"16":{"path":"blog/2023-02-23-毒瘤题,纪念一下.html","title":"2023-02-23-毒瘤题,纪念一下","tags":[],"headers":["2023-02-23-毒瘤题,纪念一下"]},"17":{"path":"blog/2023-03-04-快读模版.html","title":"2023-03-04-快读模版","tags":[],"headers":["2023-03-04-快读模版"]},"18":{"path":"blog/2023-03-10-vscode配置.html","title":"2023-03-10-VSCode配置","tags":[],"headers":["2023-03-10-VSCode配置","推荐OI类和装饰性拓展"]},"19":{"path":"blog/2023-03-15-1维dp四边形不等式优化(决策单调性优化).html","title":"2023-03-15-1维DP四边形不等式优化(决策单调性优化)","tags":[],"headers":["2023-03-15-1维DP四边形不等式优化(决策单调性优化)"]},"20":{"path":"blog/2023-03-25-2维dp四边形不等式优化(决策单调性优化).html","title":"2023-03-25-2维DP四边形不等式优化(决策单调性优化)","tags":[],"headers":["2023-03-25-2维DP四边形不等式优化(决策单调性优化)"]},"21":{"path":"blog/2023-03-26-两道有意思的微积分题目.html","title":"2023-03-26-两道有意思的微积分题目","tags":[],"headers":["2023-03-26-两道有意思的微积分题目","第一题","第二题"]},"22":{"path":"blog/2023-04-14-wqs二分.html","title":"2023-04-14-wqs二分","tags":[],"headers":["2023-04-14-wqs二分","引入","Lagrange Sufficiency  Theorem:","经典题目"]},"23":{"path":"blog/2023-04-17-dev-c++翻新.html","title":"2023-04-17-Dev-C++翻新","tags":[],"headers":["2023-04-17-Dev-C++翻新","翻新编译器","让AStyle能工作","美化 Dev C++"]},"24":{"path":"blog/2023-05-12-集合dp.html","title":"2023-05-12-集合DP","tags":[],"headers":["2023-05-12-集合DP"]},"25":{"path":"blog/2023-06-25-最小费用最大流.html","title":"2023-06-25-最小费用最大流","tags":[],"headers":["2023-06-25-最小费用最大流"]},"26":{"path":"blog/2023-07-17-不动点法求数列通项.html","title":"2023-07-17-不动点法求数列通项","tags":[],"headers":["2023-07-17-不动点法求数列通项","1","2","3","参考资料"]},"27":{"path":"blog/2023-08-24-幻影坦克.html","title":"2023-08-24-幻影坦克","tags":[],"headers":["2023-08-24-幻影坦克"]},"28":{"path":"blog/2023-09-20-csp-s-2023-复赛.html","title":"2023-09-20-CSP-S-2023-复赛","tags":[],"headers":["2023-09-20-CSP-S-2023-复赛","T2","做法1：dp","做法2：哈希"]},"29":{"path":"blog/2023-12-02-noip2023退役记.html","title":"2023-12-02-NOIP2023退役记","tags":[],"headers":["2023-12-02-NOIP2023退役记","开考","后记","总结"]},"30":{"path":"lib\\media\\cap.png","title":"cap","tags":[],"headers":[]},"31":{"path":"lib\\media\\flow.png","title":"flow","tags":[],"headers":[]},"32":{"path":"lib\\media\\res.png","title":"res","tags":[],"headers":[]},"33":{"path":"lib\\media\\aug.png","title":"aug","tags":[],"headers":[]},"34":{"path":"lib\\media\\ffkill.png","title":"ffkill","tags":[],"headers":[]},"35":{"path":"lib\\media\\lvl.png","title":"lvl","tags":[],"headers":[]},"36":{"path":"lib\\media\\bin.png","title":"bin","tags":[],"headers":[]},"37":{"path":"lib\\media\\binflow.png","title":"binflow","tags":[],"headers":[]},"38":{"path":"lib\\media\\board.png","title":"board","tags":[],"headers":[]},"39":{"path":"lib\\media\\boardnet.png","title":"boardnet","tags":[],"headers":[]},"40":{"path":"lib\\media\\inv.png","title":"inv","tags":[],"headers":[]},"41":{"path":"lib\\media\\1.jpeg","title":"1","tags":[],"headers":[]},"42":{"path":"lib\\media\\2.jpeg","title":"2","tags":[],"headers":[]},"43":{"path":"lib\\scripts\\graph-wasm.wasm","title":"graph-wasm","tags":[],"headers":[]},"44":{"path":"lib\\fonts\\94f2f163d4b698242fef.otf","title":"94f2f163d4b698242fef","tags":[],"headers":[]},"45":{"path":"lib\\fonts\\72505e6a122c6acd5471.woff2","title":"72505e6a122c6acd5471","tags":[],"headers":[]},"46":{"path":"lib\\fonts\\2d5198822ab091ce4305.woff2","title":"2d5198822ab091ce4305","tags":[],"headers":[]},"47":{"path":"lib\\fonts\\c8ba52b05a9ef10f4758.woff2","title":"c8ba52b05a9ef10f4758","tags":[],"headers":[]},"48":{"path":"lib\\fonts\\cb10ffd7684cd9836a05.woff2","title":"cb10ffd7684cd9836a05","tags":[],"headers":[]},"49":{"path":"lib\\fonts\\b5f0f109bc88052d4000.woff2","title":"b5f0f109bc88052d4000","tags":[],"headers":[]},"50":{"path":"lib\\fonts\\cbe0ae49c52c920fd563.woff2","title":"cbe0ae49c52c920fd563","tags":[],"headers":[]},"51":{"path":"lib\\fonts\\535a6cf662596b3bd6a6.woff2","title":"535a6cf662596b3bd6a6","tags":[],"headers":[]},"52":{"path":"lib\\fonts\\70cc7ff27245e82ad414.ttf","title":"70cc7ff27245e82ad414","tags":[],"headers":[]},"53":{"path":"lib\\fonts\\454577c22304619db035.ttf","title":"454577c22304619db035","tags":[],"headers":[]},"54":{"path":"lib\\fonts\\52ac8f3034507f1d9e53.ttf","title":"52ac8f3034507f1d9e53","tags":[],"headers":[]},"55":{"path":"lib\\fonts\\05b618077343fbbd92b7.ttf","title":"05b618077343fbbd92b7","tags":[],"headers":[]},"56":{"path":"lib\\fonts\\4bb6ac751d1c5478ff3a.woff2","title":"4bb6ac751d1c5478ff3a","tags":[],"headers":[]},"57":{"path":"lib\\media\\874d8b8e340f75575caa.svg","title":"874d8b8e340f75575caa","tags":[],"headers":[]},"58":{"path":"lib\\fonts\\mathjax_zero.woff","title":"mathjax_zero","tags":[],"headers":[]},"59":{"path":"lib\\fonts\\mathjax_main-regular.woff","title":"mathjax_main-regular","tags":[],"headers":[]},"60":{"path":"lib\\fonts\\mathjax_main-bold.woff","title":"mathjax_main-bold","tags":[],"headers":[]},"61":{"path":"lib\\fonts\\mathjax_math-italic.woff","title":"mathjax_math-italic","tags":[],"headers":[]},"62":{"path":"lib\\fonts\\mathjax_main-italic.woff","title":"mathjax_main-italic","tags":[],"headers":[]},"63":{"path":"lib\\fonts\\mathjax_math-bolditalic.woff","title":"mathjax_math-bolditalic","tags":[],"headers":[]},"64":{"path":"lib\\fonts\\mathjax_size1-regular.woff","title":"mathjax_size1-regular","tags":[],"headers":[]},"65":{"path":"lib\\fonts\\mathjax_size2-regular.woff","title":"mathjax_size2-regular","tags":[],"headers":[]},"66":{"path":"lib\\fonts\\mathjax_size3-regular.woff","title":"mathjax_size3-regular","tags":[],"headers":[]},"67":{"path":"lib\\fonts\\mathjax_size4-regular.woff","title":"mathjax_size4-regular","tags":[],"headers":[]},"68":{"path":"lib\\fonts\\mathjax_ams-regular.woff","title":"mathjax_ams-regular","tags":[],"headers":[]},"69":{"path":"lib\\fonts\\mathjax_calligraphic-regular.woff","title":"mathjax_calligraphic-regular","tags":[],"headers":[]},"70":{"path":"lib\\fonts\\mathjax_calligraphic-bold.woff","title":"mathjax_calligraphic-bold","tags":[],"headers":[]},"71":{"path":"lib\\fonts\\mathjax_fraktur-regular.woff","title":"mathjax_fraktur-regular","tags":[],"headers":[]},"72":{"path":"lib\\fonts\\mathjax_fraktur-bold.woff","title":"mathjax_fraktur-bold","tags":[],"headers":[]},"73":{"path":"lib\\fonts\\mathjax_sansserif-regular.woff","title":"mathjax_sansserif-regular","tags":[],"headers":[]},"74":{"path":"lib\\fonts\\mathjax_sansserif-bold.woff","title":"mathjax_sansserif-bold","tags":[],"headers":[]},"75":{"path":"lib\\fonts\\mathjax_sansserif-italic.woff","title":"mathjax_sansserif-italic","tags":[],"headers":[]},"76":{"path":"lib\\fonts\\mathjax_script-regular.woff","title":"mathjax_script-regular","tags":[],"headers":[]},"77":{"path":"lib\\fonts\\mathjax_typewriter-regular.woff","title":"mathjax_typewriter-regular","tags":[],"headers":[]},"78":{"path":"lib\\fonts\\mathjax_vector-regular.woff","title":"mathjax_vector-regular","tags":[],"headers":[]},"79":{"path":"lib\\fonts\\mathjax_vector-bold.woff","title":"mathjax_vector-bold","tags":[],"headers":[]},"80":{"path":"lib\\html\\file-tree.html","title":"file-tree","tags":[],"headers":[]},"81":{"path":"lib\\scripts\\webpage.js","title":"webpage","tags":[],"headers":[]},"82":{"path":"lib\\scripts\\graph-view.js","title":"graph-view","tags":[],"headers":[]},"83":{"path":"lib\\scripts\\graph-wasm.js","title":"graph-wasm","tags":[],"headers":[]},"84":{"path":"lib\\scripts\\graph-render-worker.js","title":"graph-render-worker","tags":[],"headers":[]},"85":{"path":"lib\\scripts\\tinycolor.js","title":"tinycolor","tags":[],"headers":[]},"86":{"path":"lib\\scripts\\pixi.js","title":"pixi","tags":[],"headers":[]},"87":{"path":"lib\\scripts\\minisearch.js","title":"minisearch","tags":[],"headers":[]},"88":{"path":"lib\\media\\favicon.ico","title":"favicon","tags":[],"headers":[]},"89":{"path":"lib\\scripts\\graph-data.js","title":"graph-data","tags":[],"headers":[]},"90":{"path":"lib\\styles\\obsidian.css","title":"obsidian","tags":[],"headers":[]},"91":{"path":"lib\\styles\\other-plugins.css","title":"other-plugins","tags":[],"headers":[]},"92":{"path":"lib\\styles\\global-variable-styles.css","title":"global-variable-styles","tags":[],"headers":[]},"93":{"path":"lib\\styles\\main-styles.css","title":"main-styles","tags":[],"headers":[]},"94":{"path":"lib\\metadata.json","title":"metadata","tags":[],"headers":[]}},"dirtCount":0,"index":[["29",{"2":{"0":1}}],["22",{"0":{"1":1,"2":1,"3":1,"4":1},"1":{"1":1,"2":1,"3":1,"4":1},"2":{"1":1,"2":1,"3":1,"4":1},"4":{"1":1,"2":1,"3":1,"4":1}}],["2246716057",{"2":{"23":1}}],["2",{"0":{"42":1},"1":{"42":1},"2":{"2":4,"4":1,"5":1,"12":1,"19":2,"26":1,"29":2},"4":{"4":1,"12":1,"26":1}}],["25",{"0":{"20":1,"25":1},"1":{"20":1,"25":1},"2":{"5":1,"20":1,"25":1},"4":{"5":1,"20":1,"25":1}}],["20",{"0":{"7":1,"15":1,"28":1},"1":{"7":1,"15":1,"28":1},"2":{"7":1,"10":1,"15":1,"28":1,"29":1},"4":{"7":1,"15":1,"28":1}}],["2022",{"0":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1},"1":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1},"2":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"10":1,"29":1},"4":{"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1}}],["2023",{"0":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1},"1":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1},"2":{"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":2,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":3},"4":{"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":2,"29":1}}],["2000010",{"2":{"28":2}}],["23",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["21",{"2":{"16":1,"17":1}}],["2维dp四边形不等式优化",{"0":{"20":1},"1":{"20":1},"2":{"20":1},"4":{"20":1}}],["26",{"0":{"21":1},"1":{"21":1},"2":{"21":1},"4":{"21":1}}],["267249434",{"2":{"23":1}}],["2758066742",{"2":{"26":1}}],["24",{"0":{"27":1},"1":{"27":1},"2":{"27":1},"4":{"27":1}}],["2d5198822ab091ce4305",{"0":{"46":1},"1":{"46":1}}],["线段树处理负数端点值",{"0":{"1":1},"1":{"1":1},"2":{"1":1},"4":{"1":1}}],["如果线段树端点值可以取负数",{"2":{"1":1}}],["如果",{"2":{"1":2,"4":1,"12":1,"20":1,"22":1,"26":1,"28":1}}],["如果每次dfs运气不好都过中间那条边的话",{"2":{"12":1}}],["如果是",{"2":{"12":1}}],["如果我这时候突然又决定把左边割掉",{"2":{"12":1}}],["如果以它为起点存在增广路",{"2":{"13":1}}],["如果能整个更新",{"2":{"19":1}}],["如果问题",{"2":{"22":1}}],["如果一个奇格子是",{"2":{"12":1}}],["如果一个残量图中没有负环",{"2":{"25":1}}],["如果只有一个不动点",{"2":{"26":1}}],["如果该元素和栈顶的是相同的",{"2":{"28":1}}],["如果有两个不动点",{"2":{"26":1}}],["如果有",{"2":{"28":1,"29":1}}],["如果多花点时间",{"2":{"29":1}}],["e",{"2":{"1":1,"3":6,"12":15,"13":4,"25":1}}],["empty",{"2":{"3":1,"12":2}}],["euler",{"2":{"8":1}}],["edmond",{"2":{"12":1},"4":{"12":1}}],["ek",{"2":{"12":1}}],["eof",{"2":{"16":1,"17":1}}],["end",{"2":{"16":1,"17":1}}],["endl",{"2":{"28":2}}],["error",{"2":{"18":1}}],["g",{"2":{"1":1,"4":5}}],["getchar",{"2":{"16":1,"17":1}}],["gc",{"2":{"16":4,"17":4}}],["gi",{"2":{"16":7,"17":2}}],["gist",{"2":{"18":2}}],["github",{"2":{"18":2}}],["greater",{"2":{"3":1}}],["graph",{"0":{"43":1,"82":1,"83":1,"84":1,"89":1},"1":{"43":1,"82":1,"83":1,"84":1,"89":1}}],["global",{"0":{"92":1},"1":{"92":1}}],["死循环",{"2":{"1":1}}],["估算",{"2":{"2":2}}],["0000",{"0":{"0":1},"1":{"0":1},"2":{"0":1},"4":{"0":1}}],["00",{"0":{"0":2},"1":{"0":2},"2":{"0":2,"29":1},"4":{"0":2}}],["0x3f",{"2":{"2":6,"3":2,"4":2}}],["0x7f",{"2":{"2":3}}],["0xc0",{"2":{"2":6}}],["0x80",{"2":{"2":3}}],["0xbf",{"2":{"2":2}}],["0",{"2":{"3":5,"4":5,"5":2,"7":11,"12":5,"13":2,"16":14,"17":6,"19":1,"20":1,"28":10},"4":{"5":2}}],["06",{"0":{"5":1,"25":1},"1":{"5":1,"25":1},"2":{"5":1,"25":1,"29":1},"4":{"5":1,"25":1}}],["01",{"0":{"8":1,"9":1,"10":1},"1":{"8":1,"9":1,"10":1},"2":{"7":1,"8":1,"9":1,"10":1},"4":{"8":1,"9":1,"10":1}}],["08",{"0":{"8":1,"9":1,"12":1,"27":1},"1":{"8":1,"9":1,"12":1,"27":1},"2":{"8":1,"9":1,"12":1,"27":1},"4":{"8":1,"9":1,"12":1,"27":1}}],["02",{"0":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"1":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"2":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1},"4":{"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"29":1}}],["05",{"0":{"11":1,"24":1},"1":{"11":1,"24":1},"2":{"11":1,"24":1},"4":{"11":1,"24":1}}],["05b618077343fbbd92b7",{"0":{"55":1},"1":{"55":1}}],["03",{"0":{"17":1,"18":1,"19":1,"20":1,"21":1},"1":{"17":1,"18":1,"19":1,"20":1,"21":1},"2":{"17":1,"18":1,"19":1,"20":1,"21":1},"4":{"17":1,"18":1,"19":1,"20":1,"21":1}}],["04",{"0":{"17":1,"22":1,"23":1},"1":{"17":1,"22":1,"23":1},"2":{"17":1,"22":1,"23":1},"4":{"17":1,"22":1,"23":1}}],["07",{"0":{"26":1},"1":{"26":1},"2":{"26":1},"4":{"26":1}}],["09",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["最大",{"2":{"2":2}}],["最大流",{"2":{"12":1},"4":{"12":1}}],["最大流就是大小最大的流",{"2":{"12":1}}],["最大流最小割定理",{"2":{"12":1},"4":{"12":1}}],["最大匹配数等于最小点覆盖",{"2":{"13":1}}],["最大化",{"2":{"22":1}}],["最小",{"2":{"2":2}}],["最小且未访问的点",{"2":{"3":1}}],["最小的点",{"2":{"3":1}}],["最小割",{"2":{"12":1},"4":{"12":1}}],["最小割定义为大小最小的割",{"2":{"12":1}}],["最小割另一个等价的定义是最小的通过删边使源点到汇点不再连通的删去的边的权值和",{"2":{"12":1}}],["最小点覆盖",{"2":{"13":1}}],["最小化",{"2":{"22":3}}],["最小黑白生成树",{"2":{"22":1}}],["最小费用最大流",{"0":{"25":1},"1":{"25":1},"2":{"25":1},"4":{"25":1}}],["最多是",{"2":{"3":1}}],["最长路问题",{"2":{"4":2}}],["最长路就是把",{"2":{"4":1}}],["最优的",{"2":{"20":1}}],["正常",{"2":{"1":1}}],["正无穷",{"2":{"2":1}}],["正确性由",{"2":{"19":1}}],["正方向是很显然的",{"2":{"13":1}}],["正方向是显然的",{"2":{"25":1}}],["正解做法",{"2":{"10":1},"4":{"10":1}}],["正解",{"2":{"28":1}}],["负无穷",{"2":{"2":1}}],["初值",{"2":{"2":1,"4":1},"4":{"2":1}}],["初始化",{"2":{"3":1}}],["初始状态",{"2":{"4":1}}],["5",{"2":{"3":1,"23":1}}],["570000004",{"2":{"7":1}}],["55",{"2":{"16":1,"17":1}}],["566595014",{"2":{"26":1}}],["535a6cf662596b3bd6a6",{"0":{"51":1},"1":{"51":1}}],["52ac8f3034507f1d9e53",{"0":{"54":1},"1":{"54":1}}],["从",{"2":{"3":1,"28":1}}],["从而",{"2":{"9":1}}],["从超级汇向每个不要睡觉的小朋友连一条权值为1的边",{"2":{"12":1}}],["从中取出若干数",{"2":{"12":1}}],["从源点向偶格子连边",{"2":{"12":1}}],["从奇格子向汇点连边",{"2":{"12":1}}],["从偶格子向它周围的四个奇格子连边",{"2":{"12":1}}],["记为",{"2":{"3":1,"26":1}}],["中选出",{"2":{"3":1}}],["中查询",{"2":{"3":1}}],["中删除",{"2":{"3":2}}],["中修改和插入",{"2":{"3":1}}],["中间的盒子可以是空盒的时候的方案数",{"2":{"10":1}}],["中所有结点和剩余容量大于",{"2":{"12":1}}],["中的边的数量是相等的",{"2":{"13":1}}],["中的边的数量比在m中的边的数量多",{"2":{"13":1}}],["中的边开始",{"2":{"13":1}}],["中的边结束的极大的路径",{"2":{"13":1}}],["中的边是不在m中的",{"2":{"13":1}}],["中",{"2":{"25":1}}],["中途手画了不少图",{"2":{"29":1}}],["把",{"2":{"3":1,"10":1,"23":1,"25":1}}],["把端点被选中的边去掉",{"2":{"13":1}}],["标记为已访问并把它从",{"2":{"3":1}}],["对",{"2":{"3":1,"12":1},"4":{"12":1}}],["对不同",{"2":{"3":1}}],["对不同$f$的复杂度分析",{"4":{"3":1}}],["对算法正确性的说明",{"2":{"7":1}}],["对于一段长度为",{"2":{"7":1}}],["对于一个未访问的点中",{"2":{"3":1}}],["对于一个奇格子",{"2":{"12":1}}],["对于任意的割",{"2":{"12":1}}],["对于所有的",{"2":{"8":2}}],["对于所有满足",{"2":{"12":1}}],["对于所有",{"2":{"20":2}}],["对于偶格子",{"2":{"12":1}}],["对于只有左端参与匹配的非匹配边",{"2":{"13":1}}],["对于剩下的匹配边选它们的右端点",{"2":{"13":1}}],["对于区间dp问题",{"2":{"20":1}}],["对于问题",{"2":{"22":1}}],["对于某个集合",{"2":{"24":1}}],["对比",{"2":{"10":1}}],["对残量图进行分层得到层次图",{"2":{"12":1}}],["对他们来说",{"2":{"12":1}}],["对称差定义",{"2":{"13":1}}],["对序列切割问题",{"2":{"19":1}}],["对上式两端取倒数",{"2":{"26":1}}],["适用范围",{"2":{"3":1},"4":{"3":1}}],["未访问的点是有待确认的点",{"2":{"3":1}}],["所有点标记为未访问",{"2":{"3":1}}],["所有出边进行松弛操作",{"2":{"3":1}}],["所有匹配边肯定被覆盖",{"2":{"13":1}}],["所有第三种边都被覆盖",{"2":{"13":1}}],["所以能让它",{"2":{"3":1}}],["所以队内元素有",{"2":{"3":1}}],["所以可以直接把之前的",{"2":{"6":1}}],["所以",{"2":{"8":1,"12":2,"25":3}}],["所以累积误差是",{"2":{"8":1}}],["所以在",{"2":{"9":2}}],["所以不能通过将",{"2":{"12":1}}],["所以所有点覆盖大于等于最大匹配",{"2":{"13":1}}],["所以选出来了最大匹配数个点",{"2":{"13":1}}],["所以d中一定存在某个极大的分量其中在m",{"2":{"13":1}}],["所以这个点的最短路确定就是",{"2":{"3":1}}],["所以这段时间很多图片都不会显示",{"2":{"15":1}}],["所以叫四边形不等式优化",{"2":{"19":1}}],["所以结果是",{"2":{"21":1}}],["所以如果能从无限制问题中的结果得到有限制问题的结果",{"2":{"22":1}}],["所以我们考虑如何用最小割建模最小的不选的总和",{"2":{"12":1}}],["所以我们需要翻新它",{"2":{"23":1}}],["所以它现在用它可能有一些问题",{"2":{"23":1}}],["所以它无法正常工作",{"2":{"23":1}}],["所以幻影坦克一般都是灰度图",{"2":{"27":1}}],["所以引入",{"2":{"28":1}}],["所以一致性还是能满足的",{"2":{"29":1}}],["所谓的幻影坦克是一类图片",{"2":{"27":1}}],["也就是",{"2":{"1":1}}],["也就是找不到终点是非匹配点的交错路",{"2":{"13":1}}],["也就是把ek算法中的bfs换成spfa",{"2":{"25":1}}],["也不能让",{"2":{"3":1}}],["也是",{"2":{"12":1}}],["也是因为这个",{"2":{"13":1}}],["也是原问题",{"2":{"22":1}}],["也可能还会出现与",{"2":{"25":1}}],["也有关",{"2":{"20":1}}],["也有边",{"2":{"29":1}}],["了",{"2":{"3":1,"20":1,"29":1}}],["暴力",{"2":{"3":1},"4":{"3":1}}],["暴力复杂度反而更优",{"2":{"3":1}}],["操作3的总复杂度为",{"2":{"3":1}}],["操作3总复杂度为",{"2":{"3":2}}],["操作4总复杂度为",{"2":{"3":1}}],["操作5的总复杂度为",{"2":{"3":1}}],["操作5总复杂度为",{"2":{"3":2}}],["堆",{"2":{"3":1},"4":{"3":1}}],["个",{"2":{"3":1}}],["个物品要放入集合",{"2":{"12":1}}],["个不同球放进",{"2":{"10":1}}],["个不同的盒子中",{"2":{"10":1}}],["个不放",{"2":{"12":1}}],["因为",{"2":{"3":1,"6":1,"25":3}}],["因为第一维被滚动掉了",{"2":{"4":1}}],["因为满足结合律所以无论怎么加括号结果都是一样的",{"2":{"4":1}}],["因为得分可能很大",{"2":{"7":1}}],["因为最大总和等于所有数的和减掉最小的不选的总和",{"2":{"12":1}}],["因为奇格子都偶格子连了个无限大的边",{"2":{"12":1}}],["因为我们可以提前知道哪些路径走下去肯定到不了终点",{"2":{"12":1}}],["因为我们要最小割",{"2":{"12":1}}],["因为匹配边没有共同的端点",{"2":{"13":1}}],["因为它变成匹配点了",{"2":{"13":1}}],["因为不会新增非匹配点",{"2":{"13":1}}],["因为以它们为起点的增广路的终点一定在左侧点中",{"2":{"13":1}}],["因为增广路长度肯定是奇数",{"2":{"13":1}}],["因为d中每个节点最多能连接两条边",{"2":{"13":1}}],["因为m",{"2":{"13":1}}],["因为可能中间反转了奇数次",{"2":{"29":1}}],["的复杂度分析",{"2":{"3":1}}],["的",{"2":{"3":1,"8":1,"9":1,"12":1,"13":1,"23":1,"28":1},"4":{"9":1}}],["的矩阵",{"2":{"4":2}}],["的分数",{"2":{"6":1}}],["的长度",{"2":{"6":1}}],["的结果即可",{"2":{"7":1}}],["的映射",{"2":{"12":2}}],["的层次图",{"2":{"12":1}}],["的对",{"2":{"12":1}}],["的对称差",{"2":{"13":1}}],["的划分",{"2":{"12":1}}],["的路径",{"2":{"12":1}}],["的点对",{"2":{"12":1}}],["的边和反向边构成的图",{"2":{"12":1},"4":{"12":1}}],["的边权为",{"2":{"12":1}}],["的边的数量",{"2":{"29":1}}],["的双向边",{"2":{"12":1}}],["的模型",{"2":{"12":1}}],["的时候不断",{"2":{"9":1}}],["的时候",{"2":{"14":1}}],["的决策",{"2":{"19":1}}],["的曲线下方面积",{"2":{"21":1}}],["的情况下使",{"2":{"22":1}}],["的最优解",{"2":{"19":1}}],["的最小值",{"2":{"22":1}}],["的最小的",{"2":{"28":1}}],["的解",{"2":{"22":1}}],["的一个解",{"2":{"22":1}}],["的反向路径",{"2":{"25":1}}],["的常数列",{"2":{"26":1}}],["的区间是可以消去的",{"2":{"28":1}}],["的单向边",{"2":{"29":1}}],["的就是答案",{"2":{"29":1}}],["稀疏图中",{"2":{"3":1}}],["稠密图中",{"2":{"3":1}}],["<",{"2":{"3":6,"12":2,"16":9,"17":4,"19":3,"20":1,"28":4}}],["<=",{"2":{"3":1,"4":12,"7":5,"12":1,"13":1,"16":22,"17":1,"19":4,"20":6,"28":5}}],["<<",{"2":{"4":3,"16":1,"17":1,"20":1,"28":4}}],["<bits",{"2":{"7":1,"16":1,"28":2}}],[">",{"2":{"3":4,"7":1,"12":2,"16":5,"17":3,"19":1,"28":3}}],[">>",{"2":{"3":1,"28":2}}],[">=",{"2":{"16":3,"17":1,"28":2}}],["p",{"2":{"4":13,"7":6,"16":4,"26":1},"4":{"9":4}}],["p+lsb",{"4":{"9":1}}],["pair",{"2":{"3":3,"28":4}}],["path",{"2":{"12":1,"13":2,"25":1}}],["part",{"2":{"16":1,"17":1}}],["priority",{"2":{"3":1}}],["printf",{"2":{"7":1,"19":1,"20":1}}],["print",{"2":{"16":5,"17":4}}],["pre",{"2":{"12":9,"16":6,"19":5}}],["problem",{"2":{"16":1}}],["programming",{"2":{"18":1}}],["p5046",{"2":{"16":1}}],["push",{"2":{"3":2,"12":4,"28":1}}],["putchar",{"2":{"16":1,"17":1}}],["putc",{"2":{"16":6,"17":5}}],["psq",{"2":{"16":3}}],["pop",{"2":{"3":1,"12":2,"28":1}}],["pos",{"2":{"19":5}}],["png",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1},"2":{"27":1}}],["p1",{"2":{"28":7}}],["p2",{"2":{"28":7}}],["pii",{"2":{"3":4}}],["pixi",{"0":{"86":1},"1":{"86":1}}],["plugins",{"0":{"91":1},"1":{"91":1}}],["s",{"0":{"28":1},"1":{"28":1},"2":{"3":4,"7":6,"8":1,"12":7,"13":1,"28":5,"29":1},"4":{"13":1,"28":1}}],["sink",{"2":{"12":1}}],["sizeof",{"2":{"3":4,"4":3,"12":2,"13":1}}],["size",{"2":{"16":5,"17":5,"28":4}}],["size1",{"0":{"64":1},"1":{"64":1}}],["size2",{"0":{"65":1},"1":{"65":1}}],["size3",{"0":{"66":1},"1":{"66":1}}],["size4",{"0":{"67":1},"1":{"67":1}}],["signed",{"2":{"16":2,"17":2}}],["symmetry",{"2":{"12":1}}],["scanf",{"2":{"7":2,"28":3}}],["sc和dt两条边可看作",{"2":{"12":1}}],["scripts",{"0":{"43":1,"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"89":1}}],["script",{"0":{"76":1},"1":{"76":1}}],["stdc++",{"2":{"7":1,"16":1,"28":2}}],["std",{"2":{"7":1,"16":1,"28":2}}],["stdin",{"2":{"16":1,"17":1}}],["stdout",{"2":{"16":1,"17":1}}],["struct",{"2":{"16":1,"17":1,"19":2,"20":1}}],["string",{"2":{"28":2}}],["stk",{"2":{"28":13}}],["st",{"2":{"28":4}}],["styles",{"0":{"90":1,"91":1,"92":2,"93":2},"1":{"92":1,"93":1}}],["sum",{"2":{"12":3,"16":3,"24":1}}],["suf",{"2":{"16":4}}],["sufficiency",{"2":{"22":1},"4":{"22":1}}],["supersets",{"2":{"24":2}}],["subsets",{"2":{"24":2}}],["successive",{"2":{"25":1}}],["source",{"2":{"12":1}}],["sort",{"2":{"16":1}}],["solve",{"2":{"16":2,"28":2}}],["sos",{"2":{"24":2}}],["second",{"2":{"3":1}}],["search",{"2":{"19":2}}],["speed",{"2":{"20":1}}],["skew",{"2":{"12":1}}],["sky",{"2":{"23":1}}],["shortest",{"2":{"12":1,"25":1}}],["shen",{"2":{"23":1}}],["ssp",{"2":{"25":1}}],["sap",{"2":{"12":1}}],["sat",{"2":{"29":2}}],["sansserif",{"0":{"73":1,"74":1,"75":1},"1":{"73":1,"74":1,"75":1}}],["svg",{"0":{"57":1}}],["bf",{"2":{"3":1}}],["bfs",{"2":{"12":4}}],["bfs+dfs每次尝试寻找多条增广路径",{"2":{"12":1},"4":{"12":1}}],["b",{"2":{"7":8,"16":7}}],["berge",{"2":{"13":1},"4":{"13":1}}],["bel",{"2":{"16":10}}],["bsize",{"2":{"16":4}}],["bl",{"2":{"16":10}}],["blog",{"0":{"0":1,"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":1,"29":1},"2":{"23":1}}],["bloodshed",{"2":{"23":1}}],["br",{"2":{"16":7}}],["bit",{"2":{"16":4}}],["bian",{"2":{"23":1}}],["bin",{"0":{"36":1},"1":{"36":1}}],["binflow",{"0":{"37":1},"1":{"37":1}}],["b图偏暗",{"2":{"27":1}}],["b1",{"2":{"28":2}}],["b2",{"2":{"28":2}}],["back",{"2":{"28":5}}],["bool",{"2":{"3":1,"12":2,"13":2}}],["board",{"0":{"38":1},"1":{"38":1}}],["boardnet",{"0":{"39":1},"1":{"39":1}}],["bold",{"0":{"60":1,"70":1,"72":1,"74":1,"79":1},"1":{"60":1,"70":1,"72":1,"74":1,"79":1}}],["bolditalic",{"0":{"63":1},"1":{"63":1}}],["b5f0f109bc88052d4000",{"0":{"49":1},"1":{"49":1}}],["void",{"2":{"3":2,"16":7,"17":4,"19":1,"20":1,"28":2}}],["vector",{"0":{"78":1,"79":1},"1":{"78":1,"79":1},"2":{"3":1}}],["v",{"2":{"3":8,"12":13,"13":6,"20":6}}],["vst",{"2":{"13":5}}],["vscode配置",{"0":{"18":1},"1":{"18":1},"2":{"18":1},"4":{"18":1}}],["vis",{"2":{"3":9}}],["view",{"0":{"82":1},"1":{"82":1}}],["val",{"2":{"19":2}}],["variable",{"0":{"92":1},"1":{"92":1}}],["=",{"2":{"3":20,"4":16,"7":19,"12":33,"13":7,"16":74,"17":18,"19":18,"20":14,"28":37}}],["=infinity",{"2":{"4":1}}],["=w",{"2":{"4":1}}],["==",{"2":{"4":1,"12":2,"16":6,"17":4,"19":1,"28":2}}],["q",{"2":{"3":6,"12":13,"13":2,"19":12,"25":1}}],["qu",{"2":{"16":3,"17":3}}],["quadruple",{"2":{"20":1}}],["queue",{"2":{"3":1,"12":2}}],["question",{"2":{"23":1,"26":1}}],["qr",{"2":{"16":4,"17":4}}],["qi",{"2":{"23":1}}],["make",{"2":{"3":2,"28":3}}],["max",{"2":{"4":2,"24":2}}],["maxflow",{"2":{"12":6}}],["maxmatch",{"2":{"13":3}}],["max的相应dp叫做",{"2":{"24":1}}],["main",{"0":{"59":1,"60":1,"62":1,"93":1},"1":{"59":1,"60":1,"62":1,"93":1},"2":{"7":1,"16":1,"28":2}}],["manually",{"2":{"16":1,"17":1}}],["match",{"2":{"13":4}}],["material",{"2":{"18":1}}],["mathjax",{"0":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1},"1":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["math",{"0":{"61":1,"63":1},"1":{"61":1,"63":1}}],["map",{"2":{"28":3}}],["m",{"2":{"7":7,"13":2,"16":3}}],["memset",{"2":{"2":1,"3":4,"4":2,"12":2,"13":1},"4":{"2":1}}],["memcpy",{"2":{"4":1}}],["merge",{"2":{"16":3}}],["mei",{"2":{"23":1}}],["media",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1,"41":1,"42":1,"57":1,"88":1}}],["method",{"2":{"8":1}}],["metadata",{"0":{"94":1},"1":{"94":1}}],["min",{"2":{"3":3,"4":5,"12":2,"24":2}}],["minisearch",{"0":{"87":1},"1":{"87":1}}],["mid",{"2":{"19":6}}],["mklink",{"2":{"23":1}}],["mod",{"2":{"7":9,"28":15}}],["modified",{"2":{"17":1}}],["mos",{"2":{"24":1}}],["move",{"2":{"28":2}}],["u",{"2":{"3":12,"12":17,"13":7}}],["using",{"2":{"7":1,"16":4,"17":3,"28":2}}],["up",{"2":{"20":1}}],["uac",{"2":{"23":1}}],["top",{"2":{"3":1}}],["to",{"2":{"3":2,"12":4,"13":1,"16":1,"17":1}}],["t1",{"2":{"5":1,"28":1,"29":2},"4":{"5":1}}],["t2",{"2":{"5":1,"28":3,"29":3},"4":{"5":1,"28":1}}],["t3",{"2":{"5":1,"28":1,"29":1},"4":{"5":1}}],["t4",{"2":{"5":1,"28":1,"29":2},"4":{"5":1}}],["t",{"2":{"12":8}}],["theorem",{"2":{"13":1,"22":1},"4":{"13":1,"22":1}}],["the",{"2":{"16":2,"17":2}}],["theme",{"2":{"18":1}}],["template",{"2":{"16":2,"17":2}}],["tabout",{"2":{"18":1}}],["ttf",{"0":{"52":1,"53":1,"54":1,"55":1}}],["typedef",{"2":{"3":1,"16":1,"28":1}}],["typewriter",{"0":{"77":1},"1":{"77":1}}],["true",{"2":{"3":2,"12":1,"13":2}}],["tree",{"0":{"80":1},"1":{"80":1}}],["tinycolor",{"0":{"85":1},"1":{"85":1}}],["hd",{"2":{"3":2,"12":3,"13":1}}],["h>",{"2":{"7":1,"16":1,"28":2}}],["html",{"0":{"0":1,"1":1,"2":1,"3":1,"4":1,"5":1,"6":1,"7":1,"8":1,"9":1,"10":1,"11":1,"12":1,"13":1,"14":1,"15":1,"16":1,"17":1,"18":1,"19":1,"20":1,"21":1,"22":1,"23":1,"24":1,"25":1,"26":1,"27":1,"28":1,"29":1,"80":2}}],["https",{"2":{"16":1,"18":2,"23":2,"26":2}}],["helper",{"2":{"18":1}}],["hungarian",{"2":{"13":1}}],["hua",{"2":{"23":1}}],["h1",{"2":{"28":10}}],["h2",{"2":{"28":10}}],["nv",{"2":{"3":2,"4":7,"12":2,"13":2}}],["nxt",{"2":{"3":2,"12":3,"13":1,"28":19}}],["nxta",{"2":{"28":9}}],["n",{"2":{"3":2,"4":3,"7":4,"12":3,"16":26,"19":8,"20":9,"28":15}}],["nstep",{"2":{"4":3}}],["namespace",{"2":{"7":1,"16":2,"17":1,"28":2}}],["n的方格里",{"2":{"12":1}}],["n方阵",{"2":{"12":1}}],["nl",{"2":{"13":2}}],["no",{"2":{"16":1,"17":1}}],["noip2022游寄",{"0":{"5":1},"1":{"5":1},"2":{"5":1,"29":1},"4":{"5":1}}],["noip2023退役记",{"0":{"29":1},"1":{"29":1},"2":{"29":1},"4":{"29":1}}],["network",{"2":{"12":4},"4":{"12":3}}],["need",{"2":{"16":1,"17":1}}],["negative",{"2":{"25":1}}],["nb",{"2":{"16":6}}],["nrp",{"2":{"16":6}}],["nq",{"2":{"28":3}}],["c",{"2":{"3":8,"12":15,"16":10,"17":10,"18":1,"23":1,"28":5}}],["copy",{"2":{"3":1,"4":2,"7":1,"12":2,"13":1,"16":1,"17":1,"19":1,"20":1,"28":3}}],["com",{"2":{"16":1,"18":2,"23":2,"26":2}}],["competitive",{"2":{"18":1}}],["continue",{"2":{"3":1,"4":1,"12":5,"13":1,"19":1}}],["const",{"2":{"16":4,"17":1,"28":3}}],["conditions",{"2":{"25":1}}],["code",{"2":{"18":1}}],["coder114514",{"2":{"18":2}}],["cout",{"2":{"28":2}}],["current",{"2":{"12":1}}],["cur",{"2":{"12":4}}],["cn",{"2":{"16":1,"23":1}}],["call",{"2":{"16":1,"17":1}}],["calligraphic",{"0":{"69":1,"70":1},"1":{"69":1,"70":1}}],["capacity",{"2":{"12":2},"4":{"12":1}}],["cap",{"0":{"30":1},"1":{"30":1}}],["cph",{"2":{"18":1}}],["c++",{"2":{"18":1,"23":7},"4":{"23":1}}],["c++翻新",{"0":{"23":1},"1":{"23":1},"2":{"23":1},"4":{"23":1}}],["c++快捷方式",{"2":{"23":1}}],["ctrl+shift+a调用",{"2":{"23":1}}],["char",{"2":{"16":2,"17":2,"28":1}}],["cheng",{"2":{"23":1}}],["cycle",{"2":{"25":1}}],["cf",{"2":{"28":1}}],["ccf版缩小了值域",{"2":{"28":1}}],["class",{"2":{"16":2,"17":2}}],["clear",{"2":{"28":1}}],["cin",{"2":{"28":1}}],["c8ba52b05a9ef10f4758",{"0":{"47":1},"1":{"47":1}}],["cb10ffd7684cd9836a05",{"0":{"48":1},"1":{"48":1}}],["cbe0ae49c52c920fd563",{"0":{"50":1},"1":{"50":1}}],["csp",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["css",{"0":{"90":1,"91":1,"92":1,"93":1}}],["+",{"2":{"3":4,"4":3,"7":2,"12":2,"16":25,"17":5,"19":5,"20":4,"28":18}}],["++",{"2":{"3":2,"4":12,"7":5,"12":1,"13":1,"16":27,"17":4,"19":4,"20":7,"28":6}}],["+=",{"2":{"7":3,"12":5,"13":1,"16":8,"28":6}}],["iv",{"2":{"3":3}}],["int",{"2":{"2":1,"3":14,"4":12,"7":8,"12":28,"13":7,"16":46,"17":2,"19":13,"20":14,"28":24}}],["integer",{"2":{"16":2,"17":2}}],["inf",{"2":{"3":1,"12":2}}],["info",{"2":{"19":4}}],["include",{"2":{"7":1,"16":1,"28":2}}],["inline",{"2":{"16":9,"17":4}}],["input",{"2":{"16":1,"17":1,"28":2}}],["init",{"2":{"16":2}}],["in1",{"2":{"16":3}}],["in2",{"2":{"16":3}}],["inequality",{"2":{"20":1}}],["inv",{"0":{"40":1},"1":{"40":1}}],["io",{"2":{"16":5,"17":5}}],["is",{"2":{"16":6,"17":6}}],["it",{"2":{"16":4,"17":4}}],["italic",{"0":{"61":1,"62":1,"75":1},"1":{"61":1,"62":1,"75":1}}],["i",{"2":{"16":4,"17":4}}],["id",{"2":{"16":11}}],["ide",{"2":{"23":2}}],["ia",{"2":{"16":5}}],["ibuf",{"2":{"16":3,"17":3}}],["ib",{"2":{"16":4}}],["i+1",{"2":{"28":1}}],["iq",{"2":{"28":3}}],["icon",{"2":{"18":1}}],["ico",{"0":{"88":1}}],["11",{"0":{"1":1,"2":1,"3":1,"4":1},"1":{"1":1,"2":1,"3":1,"4":1},"2":{"1":1,"2":1,"3":1,"4":1,"23":1},"4":{"1":1,"2":1,"3":1,"4":1}}],["1",{"0":{"41":1},"1":{"41":1},"2":{"3":2,"4":17,"7":11,"12":9,"13":2,"16":43,"17":7,"19":15,"20":12,"26":1,"28":29},"4":{"4":1,"12":1,"26":1}}],["12",{"0":{"5":1,"6":1,"7":1,"24":1,"29":1},"1":{"5":1,"6":1,"7":1,"24":1,"29":1},"2":{"5":1,"6":1,"7":1,"10":1,"24":1,"29":2},"4":{"5":1,"6":1,"7":1,"24":1,"29":1}}],["120",{"2":{"7":1}}],["15",{"0":{"6":1,"19":1},"1":{"6":1,"19":1},"2":{"6":1,"16":1,"17":1,"19":1},"4":{"6":1,"19":1}}],["151",{"2":{"28":1}}],["17",{"0":{"10":1,"23":1,"26":1},"1":{"10":1,"23":1,"26":1},"2":{"7":1,"10":1,"23":1,"26":1},"4":{"10":1,"23":1,"26":1}}],["17ae32f754658e2e5a25584cb5877eeb",{"2":{"18":1}}],["100",{"2":{"5":4},"4":{"5":4}}],["1000000007",{"2":{"7":2}}],["100020",{"2":{"7":1}}],["100+100+0+0=200",{"2":{"29":1}}],["1020",{"2":{"7":4}}],["10",{"0":{"13":1,"18":1},"1":{"13":1,"18":1},"2":{"13":1,"16":3,"17":3,"18":1,"28":1},"4":{"13":1,"18":1}}],["104544760",{"2":{"26":1}}],["1秒可以处理上万个节点的稀疏图",{"2":{"12":2}}],["18",{"0":{"14":1},"1":{"14":1},"2":{"14":1},"4":{"14":1}}],["19更新",{"2":{"15":1}}],["1维dp四边形不等式优化",{"0":{"19":1},"1":{"19":1},"2":{"19":1},"4":{"19":1}}],["14",{"0":{"22":1},"1":{"22":1},"2":{"22":1},"4":{"22":1}}],["131",{"2":{"28":1}}],["1e5",{"2":{"16":1}}],["1e9",{"2":{"28":1}}],["能平分就平分",{"2":{"1":2}}],["能解决没有负环的图上的多源多汇的最短",{"2":{"4":1}}],["能走到",{"2":{"29":3}}],["修改之后能用来计算连通性",{"2":{"4":1}}],["传递闭包",{"2":{"4":1}}],["令",{"2":{"4":2,"6":1,"8":1,"19":2,"20":1,"24":1,"28":3}}],["令d为m与m",{"2":{"13":1}}],["令一个像素点在亮背景下显示颜色",{"2":{"27":1}}],["号结点到",{"2":{"4":1}}],["号结点只经过",{"2":{"4":1}}],["号结点的最短路径",{"2":{"4":1}}],["和",{"2":{"4":1,"7":1,"10":1,"12":4,"19":1,"20":1,"28":1}}],["和快速幂一样",{"2":{"4":1}}],["和汇点",{"2":{"12":1}}],["和流",{"2":{"12":1}}],["和m是匹配边的集合",{"2":{"13":1}}],["和解决",{"2":{"22":1}}],["到",{"2":{"4":1,"9":2,"12":1,"14":1,"19":2,"20":1,"21":1,"28":1,"29":3}}],["到结点",{"2":{"4":1}}],["到超级汇的边权为",{"2":{"12":1}}],["转移方程",{"2":{"4":1}}],["k",{"2":{"4":15,"16":11,"20":9,"22":1}}],["k=2n",{"2":{"5":1}}],["killer",{"2":{"12":1}}],["karp",{"2":{"12":1}}],["karp~~动能算法~~",{"4":{"12":1}}],["konig定理和匈牙利算法",{"0":{"13":1},"1":{"13":1},"2":{"13":1},"4":{"13":1}}],["konig定理",{"2":{"13":2},"4":{"13":1}}],["knuth",{"2":{"20":1}}],["kl",{"2":{"20":2}}],["kr",{"2":{"20":2}}],["j",{"2":{"4":23,"7":17,"16":35,"19":4,"20":13,"23":1}}],["jekyll有时候会把latex公式里的一些符号当成markdown的符号处理掉",{"2":{"11":1}}],["jiang",{"2":{"23":1}}],["ji",{"2":{"23":3}}],["jpeg",{"0":{"41":1,"42":1}}],["js",{"0":{"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"89":1}}],["json",{"0":{"94":1}}],["f",{"2":{"4":17,"7":5,"12":5,"16":24,"17":4,"19":9,"20":12}}],["fulkerson",{"2":{"12":3},"4":{"12":1}}],["f$",{"4":{"12":1}}],["front",{"2":{"12":2}}],["fread",{"2":{"16":1,"17":1}}],["fraktur",{"0":{"71":1,"72":1},"1":{"71":1,"72":1}}],["floyd和倍增floyd",{"0":{"4":1},"1":{"4":1},"2":{"4":1},"4":{"4":1}}],["floyd",{"2":{"4":1},"4":{"4":1}}],["flow",{"0":{"31":1},"1":{"31":1},"2":{"12":9},"4":{"12":1}}],["flush",{"2":{"16":4,"17":4}}],["flusher",{"2":{"16":3,"17":3}}],["fwrite",{"2":{"16":1,"17":1}}],["find",{"2":{"13":3}}],["files",{"2":{"23":1}}],["file",{"0":{"80":1},"1":{"80":1}}],["ford",{"2":{"12":3},"4":{"12":1}}],["fox",{"2":{"23":1}}],["fonts",{"0":{"44":1,"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"52":1,"53":1,"54":1,"55":1,"56":1,"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["ffkill",{"0":{"34":1},"1":{"34":1}}],["false",{"2":{"12":1,"13":1}}],["favicon",{"0":{"88":1},"1":{"88":1}}],["倍增floyd",{"2":{"4":1},"4":{"4":1}}],["单源多汇最短路",{"2":{"3":1}}],["单位元是除了对角线上是",{"2":{"4":1}}],["单位元变成除了对角线上是",{"2":{"4":1}}],["表示从",{"2":{"4":1,"6":1}}],["表示从结点",{"2":{"4":1}}],["表示从i到j恰好走2^p步的最短路",{"2":{"4":1}}],["表示",{"2":{"4":1,"6":1,"8":1,"9":1,"12":1,"19":2,"28":1}}],["表示第",{"2":{"6":2}}],["表示右侧的点在这轮寻找增广路的时候有没有被访问过",{"2":{"13":1}}],["表示右侧的点匹配上了左侧的哪个点",{"2":{"13":1}}],["表示使",{"2":{"20":1}}],["表示使得",{"2":{"28":1}}],["表示集合的某个性质",{"2":{"24":1}}],["表示不存在",{"2":{"28":1}}],["表示到",{"2":{"28":1}}],["表示当前栈为",{"2":{"28":1}}],["若",{"2":{"4":1,"22":1,"28":1}}],["若这个",{"2":{"12":1}}],["若对所有",{"2":{"19":1}}],["则",{"2":{"4":1,"9":2,"19":1,"29":1}}],["恰好",{"2":{"4":1}}],["走",{"2":{"4":1}}],["步的最短路径",{"2":{"4":1}}],["否则左区间比右区间长度小1",{"2":{"1":1}}],["否则左区间比右区间长度多1",{"2":{"1":1}}],["否则f",{"2":{"4":1}}],["否则",{"2":{"12":1,"28":2}}],["否则要么路径不是极大的",{"2":{"13":1}}],["否则就在第一个不能整块更新的块里二分",{"2":{"19":1}}],["否则是",{"2":{"28":1}}],["计算中点",{"2":{"1":1}}],["计算走恰好nstep的最短路",{"2":{"4":1}}],["计算f",{"2":{"16":2}}],["结论",{"2":{"3":1},"4":{"3":1}}],["结果存在g数组里面",{"2":{"4":1}}],["结果就是",{"2":{"24":1}}],["结尾的可消去子序列的数量",{"2":{"28":1}}],["不过",{"2":{"3":1}}],["不过在实际情况中",{"2":{"8":1}}],["不过它是怎么推导出来的我还没有想通",{"2":{"10":1}}],["不过还是有缓慢的进展的",{"2":{"29":1}}],["不够过1000",{"2":{"5":1}}],["不会写",{"2":{"5":1}}],["不难发现",{"2":{"9":2}}],["不包含",{"2":{"9":2},"4":{"9":1}}],["不可达点的割",{"2":{"12":1}}],["不可达的",{"2":{"12":1}}],["不放",{"2":{"12":1}}],["不在一起要消耗",{"2":{"12":1}}],["不在同一阵营的惩罚",{"2":{"12":1}}],["不停地找增广路径",{"2":{"12":1}}],["不停找增广路",{"2":{"13":1}}],["不变时",{"2":{"14":1}}],["不降就是普通的决策单调性",{"2":{"19":1}}],["不相连的几个环圈",{"2":{"25":1}}],["不动点法求数列通项",{"0":{"26":1},"1":{"26":1},"2":{"26":1},"4":{"26":1}}],["不是最大流",{"2":{"12":1}}],["不是全为",{"2":{"26":1}}],["不是常数列",{"2":{"26":1}}],["不能拿满分",{"2":{"28":1}}],["不怎么困",{"2":{"29":1}}],["其余点的",{"2":{"3":1}}],["其余位置都是",{"2":{"4":2}}],["其中",{"2":{"8":2,"9":2,"12":3,"14":1,"19":1,"20":1,"22":2,"26":1}}],["其中有两个特殊点",{"2":{"12":1}}],["其中对于所有",{"2":{"26":1}}],["其中不动点为复数的情况比较有意思",{"2":{"26":1}}],["其实我只要再做个前缀和应该就能100了",{"2":{"5":1}}],["其实是增广路算法",{"0":{"13":1},"1":{"13":1},"2":{"13":2},"4":{"13":2}}],["其实也不是很难",{"2":{"29":1}}],["事后发现$",{"2":{"5":1}}],["$",{"2":{"5":1},"4":{"9":5}}],["$bit",{"4":{"9":4}}],["$p<i<p+lsb",{"4":{"9":1}}],["$i$",{"4":{"9":1}}],["$0$",{"4":{"12":1}}],["$g$中所有结点和剩余容量大于",{"4":{"12":1}}],["$g",{"4":{"12":1}}],["预计拿20",{"2":{"5":1}}],["8",{"2":{"5":1,"29":1},"4":{"5":1}}],["874d8b8e340f75575caa",{"0":{"57":1},"1":{"57":1}}],["写了个tarjan缩点和链的情况",{"2":{"5":1}}],["写个暴力然后就不管了",{"2":{"5":1}}],["总结",{"2":{"5":1,"29":1},"4":{"5":1,"29":1}}],["大寄特寄",{"2":{"5":1}}],["明年高三的时候希望能考好一点吧",{"2":{"5":1}}],["洛谷p1654",{"0":{"6":1},"1":{"6":1},"2":{"6":1},"4":{"6":1}}],["定义矩阵运算",{"2":{"4":1}}],["定义",{"2":{"6":1,"12":1},"4":{"6":1}}],["定义符号",{"2":{"12":1}}],["随机变量",{"2":{"6":2}}],["往前的连续",{"2":{"6":1}}],["位是否命中",{"2":{"6":1}}],["位命中的概率",{"2":{"6":1}}],["长度的递推式",{"2":{"6":1},"4":{"6":1}}],["期望值的递推式",{"2":{"6":1},"4":{"6":1}}],["与",{"2":{"6":1,"20":1}}],["无负权边",{"2":{"3":1}}],["无关",{"2":{"6":1}}],["替换为",{"2":{"6":1,"25":1}}],["君并不喜欢",{"2":{"7":1}}],["君觉得",{"2":{"7":1}}],["输入",{"2":{"7":1,"12":1,"23":1}}],["次点击",{"2":{"7":1}}],["次点击的成功率是",{"2":{"7":1}}],["已知第",{"2":{"7":1}}],["已经访问的点是已经确定了最短路的点",{"2":{"3":1}}],["已经包含",{"2":{"9":1}}],["问期望得分是多少",{"2":{"7":1}}],["并加入",{"2":{"3":1}}],["并且不是整数",{"2":{"7":1}}],["并用队列维护",{"2":{"19":1}}],["解释",{"2":{"3":1},"4":{"3":1}}],["解法",{"2":{"7":1,"12":2},"4":{"7":1,"12":2}}],["dis",{"2":{"3":21}}],["dijkstra最短路算法",{"0":{"3":1},"1":{"3":1},"2":{"3":1},"4":{"3":1}}],["dijkstra",{"2":{"3":2}}],["dinic",{"2":{"12":2},"4":{"12":1}}],["d",{"2":{"7":2,"12":1,"13":2,"16":2,"20":1,"23":2,"25":1,"28":3}}],["dfs多路探索的时候我们要应用当前弧加速",{"2":{"12":1}}],["dfs",{"2":{"12":3}}],["delta",{"2":{"12":5}}],["define",{"2":{"16":1,"17":1}}],["dev",{"0":{"23":1},"1":{"23":1},"2":{"23":8},"4":{"23":2}}],["devcpp",{"2":{"23":1}}],["dp",{"2":{"19":1,"20":1,"24":3,"28":8},"4":{"28":1}}],["da",{"2":{"23":1}}],["data",{"0":{"89":1},"1":{"89":1}}],["long",{"2":{"2":2,"7":12,"16":2,"28":4}}],["lv",{"2":{"12":10}}],["lvl",{"0":{"35":1},"1":{"35":1}}],["luogu",{"2":{"16":1,"23":1}}],["lld",{"2":{"7":2,"19":1}}],["ll",{"2":{"16":4,"19":2,"28":9}}],["l",{"2":{"16":27,"19":18}}],["latex和markdown冲突",{"0":{"11":1},"1":{"11":1},"2":{"11":1},"4":{"11":1}}],["la",{"2":{"16":10}}],["laofudasuan",{"2":{"17":1}}],["lagrange",{"2":{"22":1},"4":{"22":1}}],["lb",{"2":{"16":9}}],["lens",{"2":{"18":1}}],["len",{"2":{"20":4}}],["lib",{"0":{"30":1,"31":1,"32":1,"33":1,"34":1,"35":1,"36":1,"37":1,"38":1,"39":1,"40":1,"41":1,"42":1,"43":1,"44":1,"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"52":1,"53":1,"54":1,"55":1,"56":1,"57":1,"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1,"80":1,"81":1,"82":1,"83":1,"84":1,"85":1,"86":1,"87":1,"88":1,"89":1,"90":1,"91":1,"92":1,"93":1,"94":1}}],["z",{"2":{"7":4}}],["zao",{"2":{"23":1}}],["zhihu",{"2":{"23":1,"26":2}}],["zhuanlan",{"2":{"26":1}}],["zero",{"0":{"58":1},"1":{"58":1}}],["出处",{"2":{"8":1}}],["出处1",{"2":{"9":1}}],["出处2",{"2":{"9":1}}],["而其他的点的",{"2":{"3":1}}],["而",{"2":{"8":1}}],["而对于",{"2":{"9":1}}],["而多路探索是常数优化",{"2":{"12":1}}],["而割左边是前面一个情况",{"2":{"12":1}}],["而一个点覆盖中每条边至少有一个端点被选",{"2":{"13":1}}],["而如果我割左边一条边",{"2":{"12":1}}],["而如果我不割左边割右边",{"2":{"12":1}}],["而如果不存在增广路",{"2":{"13":1}}],["而形成回路的路径中在m中的边的数量与在m",{"2":{"13":1}}],["而相应的没有限制的问题通常会更容易解决",{"2":{"22":1}}],["而program",{"2":{"23":1}}],["而且对于它的起点和终点",{"2":{"13":1}}],["而且增广前没有负环",{"2":{"25":1}}],["是邻接矩阵",{"2":{"4":1}}],["是已知的",{"2":{"8":1}}],["是一个",{"2":{"12":1}}],["是一个很常用的",{"2":{"23":1}}],["是最大流",{"2":{"12":1}}],["是最简单的最大流算法",{"2":{"12":1}}],["是最短路矛盾",{"2":{"25":1}}],["是指一个有向图",{"2":{"12":1}}],["是指",{"2":{"14":1}}],["是",{"2":{"23":1}}],["是负环",{"2":{"25":1}}],["是使得",{"2":{"28":1}}],["是用来格式化代码的一个程序",{"2":{"23":1}}],["是用并查集做的了",{"2":{"29":1}}],["是不是有问题",{"2":{"29":1}}],["欧拉法的误差分析",{"0":{"8":1},"1":{"8":1},"2":{"8":1},"4":{"8":1}}],["欧拉法",{"2":{"8":1}}],["要满足的条件",{"2":{"8":1}}],["要消耗",{"2":{"12":2}}],["要么就是在m与m",{"2":{"13":1}}],["要么m",{"2":{"13":1}}],["要么和另外一个变量相等",{"2":{"29":1}}],["要么和另外一个变量的逆相等",{"2":{"29":1}}],["要注意边界情况",{"2":{"20":1}}],["要解的微分方程",{"2":{"8":1}}],["要解决这个问题",{"2":{"23":1}}],["要证明这个算法的正确性",{"2":{"25":1}}],["满足",{"2":{"8":2,"20":1}}],["满足每条边至少有一个端点被选",{"2":{"13":1}}],["树上dp也没想出来",{"2":{"5":1}}],["树状数组bit正确性的证明",{"0":{"9":1},"1":{"9":1},"2":{"9":1},"4":{"9":1}}],["假设树状数组是",{"2":{"9":1}}],["假设我们用数据结构",{"2":{"3":1}}],["假设我们根据之前的",{"2":{"12":1}}],["假设我们有这样的一个递推式",{"2":{"26":1}}],["假设左侧点都被增广过之后",{"2":{"13":1}}],["假设左边的点编号为",{"2":{"13":1}}],["假设匹配m",{"2":{"13":1}}],["假设沿最短路",{"2":{"25":1}}],["假设",{"2":{"26":1}}],["询问",{"2":{"9":1},"4":{"9":1}}],["根据定义",{"2":{"9":1}}],["显然最长路就是把",{"2":{"4":1}}],["显然有",{"2":{"9":1}}],["显然",{"2":{"9":1}}],["显然任意整数",{"2":{"9":1}}],["显然会产生矛盾",{"2":{"12":1}}],["显然这个过程也一定会终止",{"2":{"9":1}}],["显然这会让复杂度从",{"2":{"20":1}}],["显然是有解的",{"2":{"26":1}}],["更小的未访问的点不存在",{"2":{"3":1}}],["更小",{"2":{"3":1}}],["更新",{"2":{"9":1},"4":{"9":1}}],["更短",{"2":{"25":1}}],["分数的递推式",{"2":{"6":1},"4":{"6":1}}],["分两步",{"2":{"9":1}}],["分块",{"2":{"16":2}}],["证明",{"2":{"9":1,"12":4,"13":1,"14":1,"25":1},"4":{"9":1,"13":1,"14":1}}],["证明对任意满足",{"2":{"9":1},"4":{"9":1}}],["证明在这篇论文里",{"2":{"20":2}}],["证明见参考资料",{"2":{"26":1}}],["证明略",{"2":{"28":1}}],["真包含于",{"2":{"9":1},"4":{"9":1}}],["设为无限大",{"2":{"3":1}}],["设",{"2":{"9":2,"12":1}}],["设能达成效果的颜色为",{"2":{"27":1}}],["都不比它小",{"2":{"3":1}}],["都能写成这个形式",{"2":{"9":1}}],["都可以列出转移方程",{"2":{"20":1}}],["都存在",{"2":{"28":1}}],["第一步",{"2":{"9":1},"4":{"9":1}}],["第一个盒子和最后一个盒子非空",{"2":{"10":1}}],["第一题",{"2":{"12":1,"21":1},"4":{"12":1,"21":1}}],["第一行是n",{"2":{"12":1}}],["第二部",{"2":{"9":1},"4":{"9":1}}],["第二个参数也是同理",{"2":{"12":1}}],["第二题",{"2":{"12":1,"21":1},"4":{"12":1,"21":1}}],["第",{"2":{"12":1}}],["第2个样例就假了",{"2":{"29":1}}],["即c++的整除",{"2":{"1":1}}],["即",{"2":{"9":1,"19":1,"20":1}}],["即剩余流量",{"2":{"12":1}}],["即最大流等于最小割",{"2":{"12":1}}],["即求",{"2":{"22":1}}],["即可使用此优化",{"2":{"19":1}}],["即可",{"2":{"23":1}}],["时的累积误差",{"2":{"8":1}}],["时不断",{"2":{"9":1}}],["时刻时",{"2":{"14":1}}],["时",{"2":{"28":2}}],["时以当前位置结尾的可消去子序列数量",{"2":{"28":1}}],["书接上文",{"2":{"10":1}}],["它的",{"2":{"3":1}}],["它要满足如下三个性质",{"2":{"12":1}}],["它就能撤销掉之前的流",{"2":{"12":1}}],["它是用于保证时间复杂度正确性的一部分",{"2":{"12":1}}],["它连着的偶格子都是",{"2":{"12":1}}],["它们的组合意义相同",{"2":{"10":1}}],["它们在m中一定是未匹配点",{"2":{"13":1}}],["它们对应的是周期数列",{"2":{"26":1}}],["它们是通过",{"2":{"27":1}}],["它可以由",{"2":{"19":1}}],["需要更新",{"2":{"9":1}}],["需要在一些地方用反斜杠escape掉那些字符才行",{"2":{"11":1}}],["用来解决限定步数的最短",{"2":{"4":1}}],["用",{"2":{"11":1,"19":1,"28":1}}],["obsidian",{"0":{"90":1},"1":{"90":1},"2":{"11":1}}],["obuf",{"2":{"16":5,"17":5}}],["osu",{"0":{"6":1},"1":{"6":1},"2":{"6":1,"7":2},"4":{"6":1}}],["osu拓展",{"0":{"7":1},"1":{"7":1},"2":{"7":1,"10":1},"4":{"7":1}}],["os",{"2":{"16":6,"17":6}}],["ot",{"2":{"16":2,"17":2}}],["otf",{"0":{"44":1}}],["other",{"0":{"91":1},"1":{"91":1}}],["orz",{"2":{"17":1}}],["opt",{"2":{"19":2,"20":5}}],["optimality",{"2":{"25":1}}],["on",{"2":{"24":2}}],["之类的",{"2":{"9":1}}],["之后就好很多",{"2":{"11":1}}],["之后会论证这个定理",{"2":{"12":1}}],["注",{"2":{"12":1}}],["注意",{"2":{"12":1}}],["注意到由1和2",{"2":{"12":1}}],["注意到这个过程中原先的匹配点不会变成非匹配点",{"2":{"13":1}}],["注意到这个路径中在m",{"2":{"13":1}}],["整数数据范围和memset初值",{"0":{"2":1},"1":{"2":1},"2":{"2":1},"4":{"2":1}}],["整数数据范围",{"2":{"2":1},"4":{"2":1}}],["整数流",{"2":{"12":1}}],["但是没有修改和删除操作",{"2":{"3":1}}],["但是我错误得估计了复杂度",{"2":{"5":1}}],["但是20炸了",{"2":{"5":1}}],["但是",{"2":{"7":1}}],["但是复杂度很差",{"2":{"12":1}}],["但是为了照顾一下自己朋友的想法",{"2":{"12":1}}],["但是这与所有左侧点已经被增广过矛盾",{"2":{"13":1}}],["但是这与条件不存在增广路矛盾",{"2":{"13":1}}],["但是这与",{"2":{"25":1}}],["但是这样每次都会弹出",{"2":{"23":1}}],["但是这么做这些latex就不能在其他地方正常渲染了",{"2":{"11":1}}],["但是这么做是",{"2":{"28":1}}],["但是很多时候这样的问题难以直接解决",{"2":{"22":1}}],["但是它已经维护了好几天了",{"2":{"15":1}}],["但是它的年代有点太老了",{"2":{"23":1}}],["但是由于它会在devcpp",{"2":{"23":1}}],["但是更常见的算法是",{"2":{"25":1}}],["但是注意到这几个环圈肯定在增广之前就存在",{"2":{"25":1}}],["但一部分论证可以直接推广到非整数流的问题上",{"2":{"12":1}}],["但不能达到",{"2":{"12":1}}],["什么是网络流",{"2":{"12":1},"4":{"12":1}}],["首先已经被已经访问过的点松弛过了",{"2":{"3":1}}],["首先",{"2":{"12":1,"13":2,"26":1}}],["首先把格子按行号与列号的和的奇偶性分类",{"2":{"12":1}}],["首先无限大的边肯定不能割",{"2":{"12":1}}],["首先求不动点",{"2":{"26":1}}],["网络流入门",{"0":{"12":1},"1":{"12":1},"2":{"12":1},"4":{"12":1}}],["网络",{"2":{"12":1}}],["源点",{"2":{"12":1}}],["容量网络",{"2":{"12":1},"4":{"12":1}}],["容量",{"2":{"12":2},"4":{"12":1}}],["容量限制",{"2":{"12":1}}],["规定",{"2":{"12":1}}],["加了容量的网络",{"2":{"12":1},"4":{"12":1}}],["加了流量的网络",{"2":{"12":1},"4":{"12":1}}],["x",{"2":{"12":1,"16":24,"17":15,"19":4},"4":{"12":1}}],["x到它所在块块首的区间内的逆序对数量",{"2":{"16":1}}],["x到它所在块块尾的区间内的逆序对数量",{"2":{"16":1}}],["x86",{"2":{"23":1}}],["斜对称性",{"2":{"12":1}}],["流量网络",{"2":{"12":1},"4":{"12":1}}],["流量",{"2":{"12":1}}],["流守恒性",{"2":{"12":1}}],["流入一个点的流量等于流出这个点的流量",{"2":{"12":1}}],["流的大小定义为",{"2":{"12":1}}],["残量网络",{"2":{"12":1},"4":{"12":1}}],["一共有",{"2":{"7":1}}],["一个割",{"2":{"12":1}}],["一个匹配是最大匹配当且仅当这个二分图中不存在增广路",{"2":{"13":1}}],["一个真空中的火箭以相对自身的速度",{"2":{"14":1}}],["一个方法就是设置",{"2":{"23":1}}],["一个重要的定理",{"2":{"25":1}}],["一个流的费用是最小的",{"2":{"25":1}}],["一条边有四种情况",{"2":{"13":1}}],["一条m的",{"2":{"13":1}}],["一条m",{"2":{"13":1}}],["一般记作",{"2":{"12":1},"4":{"12":1}}],["一般来说",{"2":{"22":1}}],["一定比",{"2":{"25":1}}],["一眼大水题",{"2":{"29":1}}],["一眼不会做",{"2":{"29":1}}],["直到没有未访问的点",{"2":{"3":1}}],["直到没有任何增广路径",{"2":{"12":1}}],["直到没有负环为止",{"2":{"25":1}}],["我终于想明白算法的正确性了",{"2":{"10":1}}],["我们定义一次投票的冲突数为好朋友之间发生冲突的总数加上和所有和自己本来意愿发生冲突的人数",{"2":{"12":1}}],["我们的问题就是",{"2":{"12":1}}],["我们只需要枚举左侧点",{"2":{"13":1}}],["我们只需要枚举每个左侧点1次",{"2":{"13":1}}],["我们有时候需要解决在一定限制下的最优化问题",{"2":{"22":1}}],["我们就可以得到最大流",{"2":{"12":1}}],["我们就可以提前决定不去走它们",{"2":{"12":1}}],["我们就能更容易地解决原问题",{"2":{"22":1}}],["我们想要知道的是",{"2":{"24":1}}],["我们通过二进制表示集合",{"2":{"24":1}}],["我们可以从超级源向每个要睡觉的小朋友连一条权值为1的边",{"2":{"12":1}}],["我们可以得到负环消去算法",{"2":{"25":1}}],["我们可以先求出它的不动点",{"2":{"26":1}}],["我们需要证明算法过程中不会产生负环",{"2":{"25":1}}],["我们把复数解也考虑进来",{"2":{"26":1}}],["我目前博客里大部分图片都上传在它上面",{"2":{"15":1}}],["这个题不错",{"2":{"7":1}}],["这个式子经常过高估计欧拉法的误差",{"2":{"8":1}}],["这个区间的和",{"2":{"9":1}}],["这个区间了",{"2":{"9":1}}],["这个就是当前弧加速",{"2":{"12":1}}],["这个问题并不是很重要",{"2":{"12":1}}],["这个问题很符合上面",{"2":{"12":1}}],["这个定理保证了上述算法的正确性",{"2":{"13":1}}],["这个优化英文叫",{"2":{"20":1}}],["这个条件不对",{"2":{"29":1}}],["这条边所有的流量已经被用掉了",{"2":{"12":1}}],["这条边其实不在层次图里面",{"2":{"12":1}}],["这么建图",{"2":{"12":1}}],["这就是增广路定理",{"2":{"12":1}}],["这就意味着存在一条增广路",{"2":{"13":1}}],["这是多路探索",{"2":{"12":1}}],["这是因为若四边形不等式满足",{"2":{"19":1}}],["这样的一条路径一定是以m",{"2":{"13":1}}],["这样在枚举决策就只用枚举",{"2":{"20":1}}],["这样就可以把每个集合映射到一个整数了",{"2":{"24":1}}],["这样有时候能凑出一些特殊的容易处理的结构",{"2":{"26":1}}],["这里的",{"2":{"23":1}}],["这里的加法也可以换成",{"2":{"24":1}}],["这里以",{"2":{"24":1}}],["这里就记录一下",{"2":{"28":1}}],["这一维可以滚动数组优化",{"2":{"24":1}}],["退流",{"2":{"12":1}}],["动能算法",{"2":{"12":1}}],["找无向图最小环和检测负环",{"2":{"4":1}}],["找到的增广路径叫做最短步数增广路",{"2":{"12":1}}],["找到之后反转一下",{"2":{"13":1}}],["实际效果",{"2":{"12":2}}],["实际上流的斜对称性就是用来",{"2":{"12":1}}],["实际上",{"2":{"14":1}}],["^",{"2":{"12":3,"16":2}}],["代码",{"2":{"3":1,"4":2,"12":1,"13":1,"16":1},"4":{"3":1,"12":1,"13":1}}],["代入",{"2":{"12":1}}],["arc",{"2":{"12":1}}],["acceleration",{"2":{"12":1}}],["ab这条边为",{"2":{"12":1}}],["a1",{"2":{"16":1}}],["aj与第i块中的数形成的逆序对数量",{"2":{"16":1}}],["ans",{"2":{"16":8,"19":3,"28":6}}],["answer",{"2":{"23":1,"26":1}}],["add",{"2":{"16":3}}],["astyle",{"2":{"23":4}}],["astyle下创建临时文件",{"2":{"23":1}}],["alternating",{"2":{"13":1}}],["alpha",{"2":{"27":1}}],["a图偏亮",{"2":{"27":1}}],["augmenting",{"2":{"12":1,"13":1}}],["aug",{"0":{"33":1},"1":{"33":1}}],["ams",{"0":{"68":1},"1":{"68":1}}],["为从源点bfs到u的轮数+1",{"2":{"12":1}}],["为",{"2":{"12":1,"28":2}}],["为例子",{"2":{"24":1}}],["为msk改变后p位能形成的msk子集",{"2":{"24":1}}],["为了便于讨论",{"2":{"12":1}}],["为了让值得范围保持在",{"2":{"27":1}}],["为止的栈",{"2":{"28":1}}],["黑边残量图",{"2":{"12":1}}],["红边层次图",{"2":{"12":1}}],["每次循环能标记一个点",{"2":{"3":1}}],["每次可以可能成功或失败",{"2":{"7":1}}],["每次通过dfs找一条增广路径",{"2":{"12":1},"4":{"12":1}}],["每次通过bfs找一条增广路径",{"2":{"12":1},"4":{"12":1}}],["每次dfs前要重置这个",{"2":{"12":1}}],["每次都按管理员身份启动",{"2":{"23":1}}],["每次加入一个序列中的元素",{"2":{"28":1}}],["每轮bfs求出",{"2":{"12":1}}],["每位小朋友应该怎样投票",{"2":{"12":1}}],["每个格子里都有一个正整数",{"2":{"12":1}}],["每个非匹配点只需要被枚举一次",{"2":{"13":1}}],["每个变量逆一个点",{"2":{"29":1}}],["每个常量一个点",{"2":{"29":1}}],["后在它上面dfs多路探索得到它上最大的流",{"2":{"12":1}}],["后面再来这个结点的时候不需要再走这条边了",{"2":{"12":1}}],["后记",{"2":{"29":1},"4":{"29":1}}],["后来知道了并查集做多简单",{"2":{"29":1}}],["后来出成绩了",{"2":{"29":1}}],["||",{"2":{"12":1,"13":1,"16":1,"17":1}}],["就是不需要每次都从源点开始找增广路径",{"2":{"12":1}}],["就是满足",{"2":{"12":1}}],["就是最小的不选的总和了",{"2":{"12":1}}],["就是个不合法的匹配",{"2":{"13":1}}],["就是强化版决策单调性",{"2":{"19":1}}],["就可以求所要的前缀和了",{"2":{"9":1}}],["就可以证明该定理",{"2":{"12":1}}],["就可以得到最小消耗",{"2":{"12":1}}],["就可以通过二分",{"2":{"22":1}}],["就代表不选偶格子",{"2":{"12":1}}],["就代表不选奇格子",{"2":{"12":1}}],["就代表都不选",{"2":{"12":1}}],["就能把第二种和第四种覆盖",{"2":{"13":1}}],["就能使匹配数增加一",{"2":{"13":1}}],["就把这块丢掉",{"2":{"19":1}}],["就算",{"2":{"20":1}}],["就有单调性",{"2":{"22":1}}],["就建一条",{"2":{"29":1}}],["就直接输出了一个样例",{"2":{"29":1}}],["等价是因为最小割肯定是分为",{"2":{"12":1}}],["可以证明第一维是可以被滚动优化掉的",{"2":{"4":1}}],["可以证明这个运算是满足结合律的",{"2":{"4":1}}],["可以达到",{"2":{"12":1}}],["可以用快速幂计算",{"2":{"4":1}}],["可以用",{"2":{"12":1}}],["可以看到",{"2":{"24":1,"27":1}}],["可以这么求",{"2":{"28":1}}],["可达点和",{"2":{"12":1}}],["可达的",{"2":{"12":1}}],["可得",{"2":{"26":1,"27":1}}],["可列出方程组",{"2":{"27":1}}],["可消去的最小的",{"2":{"28":1}}],["可消去且",{"2":{"28":1}}],["由此得出",{"2":{"9":1}}],["由此可以看出正解的正确性",{"2":{"10":1}}],["由此可以推出",{"2":{"12":1}}],["由此可见这是保证了不能选相邻格子的限制的",{"2":{"12":1}}],["由此",{"2":{"26":1}}],["由引理可得",{"2":{"12":1}}],["由匹配边与非匹配边交错而成",{"2":{"13":1}}],["由牛顿第二定律可以得出",{"2":{"14":1}}],["由上面的引理容易得到对任意的流和割",{"2":{"12":1}}],["由上述定理可以看到",{"2":{"22":1}}],["由这个定理",{"2":{"25":1}}],["由于残量图中",{"2":{"12":1}}],["由于原先没有负环",{"2":{"25":1}}],["当前弧加速是必须要有的",{"2":{"12":1}}],["当前弧加速就是说",{"2":{"12":1}}],["当然还不知道是最大流",{"2":{"12":1}}],["当然",{"2":{"20":1}}],["当且仅当它对应的残量网络中不存在负环",{"2":{"25":1}}],["当",{"2":{"27":1,"28":2}}],["那么用",{"2":{"1":1}}],["那么",{"2":{"8":1,"12":1,"19":1,"22":1,"28":1}}],["那么有",{"2":{"12":1,"26":1}}],["那么如果存在一个流和一个割满足",{"2":{"12":1}}],["那么其实是不划算的",{"2":{"12":1}}],["那么以它们为起点不可能有增广路",{"2":{"13":1}}],["那么d中的边要么能组成长度为偶数的回路",{"2":{"13":1}}],["那么在",{"2":{"14":1}}],["那么我就必须把相应的4个",{"2":{"12":1}}],["那么我们可以得到如下方程",{"2":{"14":1}}],["那么对于所有",{"2":{"20":1}}],["那么经过一条最短路增广之后不会产生负环",{"2":{"25":1}}],["那么要求它的通项公式",{"2":{"26":1}}],["那么不动点有1个或者2个",{"2":{"26":1}}],["那么由",{"2":{"26":1}}],["那么两式都不为0",{"2":{"26":1}}],["那么就表示我不要奇格子",{"2":{"12":1}}],["那么就有这样的关系",{"2":{"28":1}}],["那么就消掉",{"2":{"28":1}}],["那么就说明",{"2":{"28":1}}],["那么每次更新就是",{"2":{"28":1}}],["那么这时候",{"2":{"28":1}}],["那么这个分量就必须全是",{"2":{"29":1}}],["那残量网络中肯定没有从",{"2":{"12":1}}],["那我们可以先建立一个超级源和超级汇",{"2":{"12":1}}],["那这个割就不可能是最小割了",{"2":{"12":1}}],["那增广后它就不能再作为起点",{"2":{"13":1}}],["那之后也不可能再找到增广路",{"2":{"13":1}}],["那对于所有",{"2":{"19":1}}],["那",{"2":{"22":1}}],["于是这个过程一定可以终止",{"2":{"9":1}}],["于是我们可以把点划分为",{"2":{"12":1}}],["于是他们决定发扬谦让精神",{"2":{"12":1}}],["于是所有边都被覆盖了",{"2":{"13":1}}],["于是回路一定是偶数长度的",{"2":{"13":1}}],["于是如果",{"2":{"19":1,"29":1}}],["于是",{"2":{"25":1,"26":2}}],["于是给每个变量一个点",{"2":{"29":1}}],["于是就开始疯狂修改",{"2":{"29":1}}],["得分是",{"2":{"7":1}}],["得到一个割",{"2":{"12":1}}],["得出",{"2":{"19":1,"22":1}}],["得",{"2":{"26":1,"27":1}}],["然后mathjax就不能正常渲染数学公式了",{"2":{"11":1}}],["然后根据",{"2":{"12":1}}],["然后修改残量图并给答案加上这个流",{"2":{"12":1}}],["然后右边连接着的偶格子就有保留的机会了",{"2":{"12":1}}],["然后在残量图上修改相应的流量",{"2":{"12":1}}],["然后在",{"2":{"23":1}}],["然后在递推式两端减去不动点",{"2":{"26":1}}],["然后不停地找负环",{"2":{"25":1}}],["然后两式相减得",{"2":{"26":1}}],["然后进行一定处理后能得到",{"2":{"26":1}}],["然后再上面跑一遍最大流就可以得到最大匹配了",{"2":{"12":1}}],["然后再做商可得",{"2":{"26":1}}],["然后",{"2":{"28":1,"29":1}}],["然后开始考虑正解",{"2":{"29":1}}],["然而",{"2":{"12":1}}],["二项式定理做法",{"2":{"10":1},"4":{"10":1}}],["二分图最大匹配",{"2":{"12":1},"4":{"12":1}}],["二选一",{"2":{"12":2},"4":{"12":1}}],["类似于堆",{"2":{"3":1}}],["类型的问题建模",{"2":{"12":1},"4":{"12":1}}],["连续极长的成功点击序列",{"2":{"7":1}}],["连权值为",{"2":{"12":1}}],["在有些图上运行时间会和容量成正比",{"2":{"12":1}}],["在这张图上跑最小割",{"2":{"12":1}}],["在",{"2":{"12":4,"14":1,"21":1,"22":1}}],["在一个n",{"2":{"12":1}}],["在一个二分图中",{"2":{"13":1}}],["在最大匹配中",{"2":{"13":1}}],["在最后一步之后",{"2":{"13":1}}],["在此基础上",{"2":{"13":1}}],["在大小相同的流之中",{"2":{"25":1}}],["在增广之前的图中存在",{"2":{"25":1}}],["在预览和点开的时候显示不一样的图",{"2":{"27":1}}],["在暗背景下显示颜色",{"2":{"27":1}}],["在七宝中学",{"2":{"29":1}}],["幼儿园里有n个小朋友打算通过投票来决定睡不睡午觉",{"2":{"12":1}}],["才能使冲突数最小",{"2":{"12":1}}],["再看osu拓展",{"0":{"10":1},"1":{"10":1},"2":{"7":1,"10":1},"4":{"10":1}}],["再跑最小割就能得到答案了",{"2":{"12":1}}],["再将",{"2":{"14":1}}],["再加上直接是常量",{"2":{"29":1}}],["使得任意两个取出的数所在格子没有公共边",{"2":{"12":1}}],["使用bfs分层+dfs多路探索以及当前弧加速",{"2":{"12":1}}],["使用反证法",{"2":{"13":1,"25":1}}],["使",{"2":{"22":2}}],["且边权非负",{"2":{"3":1}}],["且取出的数的总和尽量大",{"2":{"12":1}}],["且两层循环的枚举顺序可以任意",{"2":{"24":1}}],["且",{"2":{"26":1}}],["且暴力感觉不好写",{"2":{"29":1}}],["接下来n行是n",{"2":{"12":1}}],["接下来我们只要能构造出一个等于最大匹配数的点覆盖就可以证明konig定理",{"2":{"13":1}}],["接下来我们这么构造点覆盖",{"2":{"13":1}}],["接下来考虑所有非匹配边",{"2":{"13":1}}],["接下来证明要更新的是",{"2":{"9":1}}],["接下来证明反方向",{"2":{"13":1}}],["接下来状态压缩",{"2":{"28":1}}],["权值为格子中的值",{"2":{"12":2}}],["权值为",{"2":{"12":1}}],["考虑无限制问题",{"2":{"22":1}}],["考虑一个割",{"2":{"12":1}}],["考虑一个栈",{"2":{"28":1}}],["考场上没思路",{"2":{"5":1}}],["考场上",{"2":{"28":1}}],["里面三层循环可以任意交换顺序",{"2":{"4":1}}],["里是不选它",{"2":{"12":1}}],["里是不选",{"2":{"12":1}}],["里是选它",{"2":{"12":1}}],["里是选",{"2":{"12":1}}],["奇格子是",{"2":{"12":2}}],["偶格子不能是",{"2":{"12":1}}],["偶格子也是",{"2":{"12":1}}],["偶格子是",{"2":{"12":1}}],["求最小消耗",{"2":{"12":1}}],["求出最小割",{"2":{"12":1}}],["求出后就从右到左看它能更新哪些",{"2":{"19":1}}],["求加法的相应dp叫做",{"2":{"24":1}}],["求min",{"2":{"24":1}}],["求不动点",{"2":{"26":1}}],["按照集合划分理解",{"2":{"12":1},"4":{"12":1}}],["按照割边来理解",{"2":{"12":1},"4":{"12":1}}],["图中橙边",{"2":{"12":1}}],["图中蓝边",{"2":{"12":1}}],["或集合",{"2":{"12":1}}],["或2个3个",{"2":{"12":1}}],["或者减少的质量",{"2":{"14":1}}],["或者",{"2":{"24":1}}],["全部割掉才能使图不连通",{"2":{"12":1}}],["割的大小定义为",{"2":{"12":1}}],["割左边的话就没必要割右边了",{"2":{"12":1}}],["常见结构",{"2":{"12":1},"4":{"12":1}}],["同阵营奖励",{"2":{"12":1}}],["节点的集合",{"2":{"13":1}}],["点覆盖",{"2":{"13":1}}],["点数最少的点覆盖",{"2":{"13":1}}],["匹配边",{"2":{"13":1}}],["匹配边变非匹配边",{"2":{"13":1}}],["非匹配边",{"2":{"13":3}}],["两倍不会溢出的",{"2":{"2":1}}],["两端点都参与匹配",{"2":{"13":1}}],["两道有意思的微积分题目",{"0":{"21":1},"1":{"21":1},"2":{"21":1},"4":{"21":1}}],["只需要输出得分模",{"2":{"7":1}}],["只有左端点参与匹配",{"2":{"13":1}}],["只有右端点参与匹配",{"2":{"13":1}}],["只有一条边也可以",{"2":{"13":1}}],["只可能会新增匹配点",{"2":{"13":1}}],["只要它的前两个参数满足上面两个条件",{"2":{"20":1}}],["重复3",{"2":{"3":1}}],["重复步骤1",{"2":{"13":1}}],["重复过步骤1之后",{"2":{"13":1}}],["选取它的左端点",{"2":{"13":1}}],["选的点都是匹配边的端点",{"2":{"13":1}}],["选出来的点确实组成点覆盖",{"2":{"13":1}}],["匈牙利算法",{"2":{"13":1},"4":{"13":1}}],["交错路",{"2":{"13":1}}],["起点和终点都不参与匹配的交错路",{"2":{"13":1}}],["枚举起点",{"2":{"13":1}}],["枚举起点时",{"2":{"13":1}}],["反向边省略",{"2":{"12":1}}],["反之亦然",{"2":{"13":1}}],["反方向不好证明",{"2":{"25":1}}],["没有边",{"2":{"4":1}}],["没有增广路之后就得到了最大匹配",{"2":{"13":1}}],["综上",{"2":{"13":2}}],["返回值代表有没有找到增广路",{"2":{"13":1}}],["条件是当前的匹配m下二分图不存在增广路",{"2":{"13":1}}],["比如",{"2":{"1":1}}],["比如修改",{"2":{"9":1}}],["比如我们之前选的流不够好",{"2":{"12":1}}],["比如对于这个二分图",{"2":{"12":1}}],["比如有",{"2":{"12":1}}],["比匹配m更大",{"2":{"13":1}}],["比m更大",{"2":{"13":1}}],["比",{"2":{"22":1}}],["间交替的路径",{"2":{"13":1}}],["变成",{"2":{"4":2,"14":2}}],["变质量系统中力与动量的关系",{"0":{"14":1},"1":{"14":1},"2":{"14":1},"4":{"14":1}}],["增广路径就是残量网络上从源点到汇点的一条路径",{"2":{"12":1}}],["增广路",{"2":{"13":1}}],["增广的时候就应该找到这条增广路了",{"2":{"13":1}}],["增广后产生了一个负环",{"2":{"25":1}}],["增广前后没有变化",{"2":{"25":2}}],["增加的质量",{"2":{"14":1}}],["速度从",{"2":{"14":2}}],["例题",{"2":{"12":1},"4":{"12":1}}],["例子",{"2":{"14":1},"4":{"14":1}}],["火箭方程",{"2":{"14":1},"4":{"14":1}}],["向0取整",{"2":{"1":1}}],["向反方向喷射气体",{"2":{"14":1}}],["云图床炸了",{"0":{"15":1},"1":{"15":1},"2":{"15":1},"4":{"15":1}}],["云图床",{"2":{"15":1}}],["好朋友之间连一条权值为1的双向边",{"2":{"12":1}}],["好像在进行维护工作",{"2":{"15":1}}],["虽然每个人都有自己的主见",{"2":{"12":1}}],["虽然上面说",{"2":{"15":1}}],["请过几分钟回来",{"2":{"15":1}}],["希望它赶快搞好吧",{"2":{"15":1}}],["3",{"2":{"15":1,"20":1,"26":1},"4":{"26":1}}],["370",{"2":{"16":1}}],["30",{"2":{"20":1}}],["3e5",{"2":{"28":1}}],["似乎现在开始恢复了",{"2":{"15":1}}],["现在彻底寄了",{"2":{"15":1}}],["毒瘤题",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["纪念一下",{"0":{"16":1},"1":{"16":1},"2":{"16":1},"4":{"16":1}}],["题面",{"2":{"7":1},"4":{"7":1}}],["题目",{"2":{"16":1}}],["提交次数多达两页半",{"2":{"16":1}}],["9",{"2":{"16":3,"17":2}}],["94f2f163d4b698242fef",{"0":{"44":1},"1":{"44":1}}],["~",{"2":{"16":1,"17":1}}],["y表示流量",{"2":{"12":1},"4":{"12":1}}],["y",{"2":{"16":15}}],["yao",{"2":{"20":1}}],["return",{"2":{"7":1,"12":7,"13":3,"16":3,"19":1,"28":2}}],["remaining",{"2":{"16":1,"17":1}}],["residual",{"2":{"12":2},"4":{"12":1}}],["res",{"0":{"32":1},"1":{"32":1},"2":{"16":3}}],["regular",{"0":{"59":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"71":1,"73":1,"76":1,"77":1,"78":1},"1":{"59":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"71":1,"73":1,"76":1,"77":1,"78":1}}],["render",{"0":{"84":1},"1":{"84":1}}],["r",{"2":{"16":25,"19":20}}],["runner",{"2":{"18":1}}],["算法过程",{"2":{"3":1},"4":{"3":1}}],["算法结束",{"2":{"3":1}}],["算法",{"2":{"12":1,"25":1},"4":{"12":1}}],["算法就要找200次增广路了",{"2":{"12":1}}],["算法找到了一个流",{"2":{"12":1}}],["算法终止条件",{"2":{"12":1}}],["算pre和suf",{"2":{"16":1}}],["算是一个好结局吧",{"2":{"29":1}}],["块i到块j的这段区间内的逆序对数量",{"2":{"16":1}}],["块内排序",{"2":{"16":1}}],["推荐oi类和装饰性拓展",{"2":{"18":1},"4":{"18":1}}],["配置文件",{"2":{"18":1}}],["6f941aaa7e2f4706b7820ba28f656d4c",{"2":{"18":1}}],["决策单调性优化",{"0":{"19":1,"20":1},"1":{"19":1,"20":1},"2":{"19":1,"20":1},"4":{"19":1,"20":1}}],["作为一段的代价",{"2":{"19":1}}],["有",{"2":{"19":2,"20":1}}],["有满足",{"2":{"22":1}}],["有单调性",{"2":{"22":1}}],["有一个非空交集",{"2":{"25":1}}],["有点像",{"2":{"29":1}}],["四边形不等式",{"2":{"19":1,"20":1}}],["合并",{"2":{"19":1}}],["数值",{"2":{"2":2}}],["数组中一段相同的值",{"2":{"19":1}}],["保证",{"2":{"19":1}}],["区间包含单调性",{"2":{"20":1}}],["降低到",{"2":{"20":1}}],["均摊枚举决策的循环",{"2":{"20":1}}],["优先队列",{"2":{"3":1},"4":{"3":1}}],["优先队列复杂度比暴力更优",{"2":{"3":1}}],["优化还是能用",{"2":{"20":1}}],["相当于在近似",{"2":{"21":1}}],["www",{"2":{"16":1,"23":2,"26":1}}],["wqs二分",{"0":{"22":1},"1":{"22":1},"2":{"22":1},"4":{"22":1}}],["wasm",{"0":{"43":2,"83":1},"1":{"43":1,"83":1}}],["webpage",{"0":{"81":1},"1":{"81":1}}],["woff2",{"0":{"45":1,"46":1,"47":1,"48":1,"49":1,"50":1,"51":1,"56":1}}],["woff",{"0":{"58":1,"59":1,"60":1,"61":1,"62":1,"63":1,"64":1,"65":1,"66":1,"67":1,"68":1,"69":1,"70":1,"71":1,"72":1,"73":1,"74":1,"75":1,"76":1,"77":1,"78":1,"79":1}}],["worker",{"0":{"84":1},"1":{"84":1}}],["原来是被攻击了",{"2":{"15":1}}],["原始论文",{"2":{"22":1}}],["原题",{"2":{"28":1}}],["原题的代码",{"2":{"28":1}}],["引理",{"2":{"12":1}}],["引入",{"2":{"22":1},"4":{"22":1}}],["该定理可以用反证法简单地证明",{"2":{"22":1}}],["关于k的循环必须在最外层",{"2":{"4":1}}],["关于",{"2":{"22":2}}],["关于不同的限制",{"2":{"22":1}}],["简单题",{"2":{"5":1}}],["简单",{"2":{"22":1}}],["来估计算法复杂度",{"2":{"12":1}}],["来找到答案",{"2":{"22":1}}],["具有凸性",{"2":{"22":1}}],["具体问题具体分析",{"2":{"19":1}}],["具体做法",{"2":{"23":1}}],["具体哪个忘了",{"2":{"29":1}}],["凸性可以通过暴力算法打印数据找规律",{"2":{"22":1}}],["猜蒙凑",{"2":{"22":1}}],["翻新编译器",{"2":{"23":1},"4":{"23":1}}],["让astyle能工作",{"2":{"23":1},"4":{"23":1}}],["下图中每条边的边权都是1",{"2":{"12":1}}],["下的文件夹有权限问题",{"2":{"23":1}}],["下面是几个例子",{"2":{"26":1}}],["右侧点还有未匹配的",{"2":{"13":1}}],["右键dev",{"2":{"23":1}}],["属性",{"2":{"23":1}}],["兼容性",{"2":{"23":1}}],["打勾",{"2":{"23":1}}],["窗口",{"2":{"23":1}}],["很麻烦",{"2":{"23":1}}],["另一个解决办法就是用目录联接",{"2":{"23":1}}],["快读模版",{"0":{"17":1},"1":{"17":1},"2":{"17":1},"4":{"17":1}}],["快捷方式不行",{"2":{"23":1}}],["放到一个没有权限问题的地方",{"2":{"23":1}}],["文件夹中以管理员身份启动命令行",{"2":{"23":1}}],["美化",{"2":{"23":1},"4":{"23":1}}],["集合dp",{"0":{"24":1},"1":{"24":1},"2":{"24":1},"4":{"24":1}}],["子集dp",{"2":{"24":2}}],["子集dp和超集dp的转移方程基本是一样的",{"2":{"24":1}}],["超级源到",{"2":{"12":1}}],["超集dp",{"2":{"24":2}}],["超集的结果",{"2":{"24":1}}],["除到右边即可得到上述方程",{"2":{"14":1}}],["除了条件要反一下",{"2":{"24":1}}],["本文只考虑整数容量",{"2":{"12":1}}],["本文暂时略过",{"2":{"25":1}}],["先把astyle文件夹剪切到",{"2":{"23":1}}],["先找到一个最大流",{"2":{"25":1}}],["先写了一个暴力",{"2":{"29":1}}],["沿负环增广",{"2":{"25":1}}],["欲证明",{"2":{"25":1}}],["必须放在一起",{"2":{"12":1}}],["必定与",{"2":{"25":1}}],["必定在某个环上",{"2":{"29":1}}],["会变时还是这样的吗",{"2":{"14":1}}],["会变时方程是这样的",{"2":{"14":1}}],["会得到一条新的路径",{"2":{"25":1}}],["今天复习数列",{"2":{"26":1}}],["形式化地",{"2":{"12":2}}],["形成等差数列",{"2":{"26":1}}],["形成等比数列",{"2":{"26":1}}],["牛顿迭代法求",{"2":{"26":1}}],["式子两端减去一个不动点",{"2":{"26":1}}],["式子两端各自减去两个不动点",{"2":{"26":1}}],["参考资料",{"2":{"26":1},"4":{"26":1}}],["幻影坦克",{"0":{"27":1},"1":{"27":1},"2":{"27":1},"4":{"27":1}}],["格式的",{"2":{"27":1}}],["通常运行速度达不到这个上界这么慢",{"2":{"12":1}}],["通常它们可以写成如下形式",{"2":{"22":1}}],["通道实现的",{"2":{"27":1}}],["三个分量都相等时方程才有解",{"2":{"27":1}}],["内层循环枚举",{"2":{"24":1}}],["内",{"2":{"27":1}}],["复杂度",{"2":{"3":3,"12":3}}],["复杂度往往达不到这个上界",{"2":{"12":1}}],["复赛",{"0":{"28":1},"1":{"28":1},"2":{"28":1,"29":1},"4":{"28":1}}],["做商",{"2":{"26":1}}],["做出来了",{"2":{"28":1}}],["做法1",{"2":{"28":1},"4":{"28":1}}],["做法2",{"2":{"28":1},"4":{"28":1}}],["做一个哈希",{"2":{"28":1}}],["上面每条边的权值等于这条边的容量",{"2":{"12":1},"4":{"12":1}}],["上有原题",{"2":{"28":1}}],["存在常数",{"2":{"8":2}}],["存在",{"2":{"28":1}}],["存在的话",{"2":{"28":1}}],["哈希",{"2":{"28":1},"4":{"28":1}}],["给",{"2":{"28":1}}],["维护每个点的",{"2":{"3":1}}],["维护",{"2":{"28":1}}],["7",{"2":{"28":1}}],["72505e6a122c6acd5471",{"0":{"45":1},"1":{"45":1}}],["709",{"2":{"16":1}}],["70cc7ff27245e82ad414",{"0":{"52":1},"1":{"52":1}}],["前几次",{"2":{"29":1}}],["开头的可消去子串的数量",{"2":{"28":1}}],["开考",{"2":{"29":1},"4":{"29":1}}],["开心地写好一个程序",{"2":{"29":1}}],["开始担心自己做的",{"2":{"29":1}}],["早上起来睡得不错",{"2":{"29":1}}],["多到考场",{"2":{"29":1}}],["他们也可以投和自己本来意愿相反的票",{"2":{"12":1}}],["他们在修路",{"2":{"29":1}}],["进考场以后就是调机器等密码",{"2":{"29":1}}],["拿到密码后开始干题目",{"2":{"29":1}}],["半小时之后完成",{"2":{"29":1}}],["忘记",{"2":{"29":1}}],["发现经过所有的操作之后每个变量要么等于一个常量",{"2":{"29":1}}],["发现这是个基环森林",{"2":{"29":1}}],["外层循环枚举",{"2":{"24":1}}],["外加每个常量是没有出边的",{"2":{"29":1}}],["碰到了这个东西",{"2":{"26":1}}],["碰到地情况包括但不限于输出错误答案",{"2":{"29":1}}],["程序卡住等",{"2":{"29":1}}],["卡在某个样例上",{"2":{"29":1}}],["经典题目",{"2":{"22":1},"4":{"22":1}}],["经过大量研究后发现",{"2":{"29":1}}],["经过2小时的苦干后",{"2":{"29":1}}],["目录",{"0":{"0":1},"1":{"0":1},"2":{"0":1},"4":{"0":1}}],["目前为止知道了如果",{"2":{"29":1}}],["以管理员身份运行此程序",{"2":{"23":1}}],["以及找出分量遍历环的时候也需要记录走形如",{"2":{"29":1}}],["过了大样例",{"2":{"29":1}}],["过了所有样例",{"2":{"29":1}}],["看最后时间不多了",{"2":{"29":1}}],["看其他人游记",{"2":{"29":1}}],["感觉这次又要寄了",{"2":{"29":1}}],["还是很好想的",{"2":{"5":1}}],["还算不错",{"2":{"29":1}}],["调用之后没有效果",{"2":{"23":1}}],["调代码时间用得太多了",{"2":{"29":1}}],["应用",{"2":{"12":1},"4":{"12":1}}],["应该还是能干不少分的",{"2":{"29":1}}],["454577c22304619db035",{"0":{"53":1},"1":{"53":1}}],["4bb6ac751d1c5478ff3a",{"0":{"56":1},"1":{"56":1}}]],"serializationVersion":2}
\ No newline at end of file