树链剖分+O(n)的差分求最值，不幸低于暴力

P3128 [USACO15DEC] Max Flow P

lqlm
by OraclePi @ 2020-10-03 21:25:18

---

线段树不香吗？
by Dixiky_215 @ 2020-10-04 13:02:05

---

|