摘要：
Some Templates Maximum Flow (Minimum Cut) template < class T, int N, int M > struct MaxFlow { int n; int cnt = 1, head[N]; struct Edge { T flow; int n 阅读全文
posted @ 2024-02-16 19:59
CountingGroup
阅读(18)
评论(0)
推荐(0)
摘要：
1929. Codeforces Round 926 (Div. 2) 寄寄寄。 A. Sasha and the Beautiful Array 容易发现 \(\displaystyle \sum_{i = 2}^{n}(a_i - a_{i - 1}) = a_n - a_1\)，令 \(\di 阅读全文
posted @ 2024-02-16 16:02
CountingGroup
阅读(43)
评论(0)
推荐(0)
浙公网安备 33010602011771号