http://uoj.ac -> https://uoj.ac

diff --git a/docs/graph/bfs.md b/docs/graph/bfs.md
index 3e3e34a..26e7869 100644 (file)
--- a/docs/graph/bfs.md
+++ b/docs/graph/bfs.md
@@ -115,7 +115,7 @@ BFS 序列通常也不唯一。
 
 ## 例题
 
--    [「NOIP2017」奶酪](http://uoj.ac/problem/332) 
+-    [「NOIP2017」奶酪](https://uoj.ac/problem/332) 
 
 ## 参考
 

diff --git a/docs/math/simplex.md b/docs/math/simplex.md
index b75fd04..681247c 100644 (file)
--- a/docs/math/simplex.md
+++ b/docs/math/simplex.md
@@ -669,7 +669,7 @@ $$
 
 ## 习题练习
 
--    [UOJ#179. 线性规划](http://uoj.ac/problem/179) 
+-    [UOJ#179. 线性规划](https://uoj.ac/problem/179) 
 
 ## 参考资料
 

diff --git a/docs/misc/mo-algo-on-tree.md b/docs/misc/mo-algo-on-tree.md
index b9946a5..f3b1033 100644 (file)
--- a/docs/misc/mo-algo-on-tree.md
+++ b/docs/misc/mo-algo-on-tree.md
@@ -17,7 +17,7 @@ dfs 一棵树，然后如果 dfs 到 x 点，就 `push_back(x)` ，dfs 完 x 点
 
 这样的话，我们就把一棵树处理成了序列。
 
-???+note "例题[「WC2013」糖果公园](http://uoj.ac/problem/58)"
+???+note "例题[「WC2013」糖果公园](https://uoj.ac/problem/58)"
     题意：给你一棵树，每个点有颜色，每次询问
 
     $$\sum_{c}val_c\sum_{i=1}^{cnt_c}w_i$$

diff --git a/docs/topic/graph-matching/bigraph-match.md b/docs/topic/graph-matching/bigraph-match.md
index dd5d4d9..bd81e6a 100644 (file)
--- a/docs/topic/graph-matching/bigraph-match.md
+++ b/docs/topic/graph-matching/bigraph-match.md
@@ -112,7 +112,7 @@ Dinic 算法分成两部分，第一部分用 $O(m)$ 时间 BFS 建立网络流
 
 ## 习题
 
-??? note "[UOJ #78. 二分图最大匹配](http://uoj.ac/problem/78) "
+??? note "[UOJ #78. 二分图最大匹配](https://uoj.ac/problem/78) "
 
     模板题
     ```cpp

diff --git a/docs/topic/graph-matching/bigraph-weight-match.md b/docs/topic/graph-matching/bigraph-weight-match.md
index 8615bb2..668de7d 100644 (file)
--- a/docs/topic/graph-matching/bigraph-weight-match.md
+++ b/docs/topic/graph-matching/bigraph-weight-match.md
@@ -227,7 +227,7 @@ struct hungarian {  // km
 
 ## 习题
 
-??? note "[UOJ #78. 二分图最大匹配](http://uoj.ac/problem/78) "
+??? note "[UOJ #78. 二分图最大匹配](https://uoj.ac/problem/78) "
 
     模板题
     ```cpp

diff --git a/docs/topic/graph-matching/general-match.md b/docs/topic/graph-matching/general-match.md
index d843db9..020554f 100644 (file)
--- a/docs/topic/graph-matching/general-match.md
+++ b/docs/topic/graph-matching/general-match.md
@@ -215,7 +215,7 @@ vector<int> find_max_unweighted_matching(const undirectedgraph<T> &g) {
 
 ## 习题
 
-??? note "[UOJ #79. 一般图最大匹配](http://uoj.ac/problem/79) "
+??? note "[UOJ #79. 一般图最大匹配](https://uoj.ac/problem/79) "
 
     ```cpp
     #include <bits/stdc++.h>

diff --git a/docs/topic/graph-matching/general-weight-match.md b/docs/topic/graph-matching/general-weight-match.md
index a1229ad..678d36f 100644 (file)
--- a/docs/topic/graph-matching/general-weight-match.md
+++ b/docs/topic/graph-matching/general-weight-match.md
@@ -8,4 +8,4 @@ author: accelsao
 
 ## 习题
 
--    [UOJ #81. 一般图最大权匹配](http://uoj.ac/problem/81) 
+-    [UOJ #81. 一般图最大权匹配](https://uoj.ac/problem/81)