![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
倍增
wind_bow
.。
展开
-
Educational Codeforces Round 66 (Rated for Div. 2) E. Minimal Segment Cover 倍增
E. Minimal Segment Covertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given nn intervals in form [l;r][l;r] on a numbe...原创 2019-06-06 21:22:56 · 266 阅读 · 0 评论 -
P3128 [USACO15DEC]最大流Max Flow 树上差分
https://www.luogu.org/problem/P3128Farmer John has installed a new system of N−1N-1N−1 pipes to transport milk between the NNN stalls in his barn (2≤N≤50,0002 \leq N \leq 50,0002≤N≤50,000), convenie...原创 2019-08-07 10:32:24 · 161 阅读 · 0 评论