Commit a1a98dff authored Oct 21, 2019 by ouuan

✨ change luogu to loj

parent 2f4d3cc1

docs/dp/opt/monotonous-queue-stack.md

+1 −1

Original line number	Diff line number	Diff line
		@@ -33,7 +33,7 @@ author: TrisolarisHD, hsfzLZH1, Ir1d, greyqz, Anguei, billchenchina, Chrogeek, C

		## 习题

		[「Luogu P1886」滑动窗口](https://www.luogu.org/problemnew/show/P1886)
		[「Luogu P1886」滑动窗口](https://loj.ac/problem/10175)

		[「NOI2005」瑰丽华尔兹](https://www.luogu.org/problem/P2254)

docs/dp/opt/quadrangle.md

+1 −1

Original line number	Diff line number	Diff line
		@@ -282,7 +282,7 @@ $$

		## 习题

		[「Luogu P4767」「IOI2000」邮局](https://www.luogu.org/problemnew/show/P4767)
		[「IOI2000」邮局](https://www.luogu.org/problemnew/show/P4767)

		## 参考资料

docs/graph/flow/bound.md

+1 −1

Original line number	Diff line number	Diff line
		@@ -61,7 +61,7 @@

		我们在残量网络上再跑一次 T 到 S 的最大流，将可行流流量减去最大流流量即为答案。

		??? note "[AHOI 2014 支线剧情](https://www.luogu.org/problem/P4043)"
		??? note "[AHOI 2014 支线剧情](https://loj.ac/problem/2226)"

		对于每条 x 到 y 花费 v 的剧情边设上界为 $\inf$ , 下界为 1。