42 lines
1.7 KiB
Markdown
42 lines
1.7 KiB
Markdown
|
||
##[$zkw$ 线段树的介绍](https://www.cnblogs.com/Judge/p/9514862.html)
|
||
|
||
[HDU 5820 Lights【zkw线段树，扫描线】](https://yukizzz.github.io/2016/08/23/HDU-5820-Lights%E3%80%90zkw%E7%BA%BF%E6%AE%B5%E6%A0%91%EF%BC%8C%E6%89%AB%E6%8F%8F%E7%BA%BF%E3%80%91/)
|
||
|
||
Bzoj 3813 (区间内某个值是否出现过)
|
||
codevs 2000 (区间最长上升子序列)
|
||
codevs 3044 (矩阵面积求并)
|
||
Hdu 4419 (多色矩形面积并)
|
||
Hdu 2305 (最值维护)
|
||
|
||
[在树上做主席树，用到树上差分](https://blog.csdn.net/ModestCoder_/article/details/89385761)
|
||
|
||
[差分思想+主席树，难题](https://blog.csdn.net/ModestCoder_/article/details/89421313)
|
||
|
||
[$dfs$序+主席树](https://blog.csdn.net/ModestCoder_/article/details/89480609)
|
||
|
||
[以及我个人关于一类题用主席树的想法](https://blog.csdn.net/ModestCoder_/article/details/90084023)
|
||
|
||
|
||
|
||
#### (7)、可持久化线段树 (主席树)
|
||
|
||
[$AcWing$ $255$. 第$K$小数](https://www.cnblogs.com/littlehb/p/16174765.html)
|
||
|
||
[$P3834$ 【模板】可持久化线段树 $2$](https://www.luogu.com.cn/problem/P3834)
|
||
本题和$AcWing$ $255$是一道题，数据范围是$2e5$,其它一样一样的
|
||
|
||
[$POJ$ $K-th$ $Number$](http://poj.org/problem?id=2104)
|
||
[$POJ$ $2761$ $Feed$ $the$ $dogs$](http://poj.org/problem?id=2761)
|
||
这两道题与上面两道也是同一道题，不过这里可以考虑学习整体二分进行解决
|
||
|
||
|
||
[$P3567$ [$POI2014$]$KUR-Couriers$](https://www.cnblogs.com/littlehb/p/17016656.html)
|
||
|
||
[$P1801$ 黑匣子](https://www.cnblogs.com/littlehb/p/17016700.html)
|
||
|
||
[$P3919$ 【模板】可持久化线段树 1(可持久化数组)](https://www.cnblogs.com/littlehb/p/17016879.html)
|
||
|
||
[$HDU$ $5280$ $Lights$](https://www.cnblogs.com/littlehb/p/16220832.html)
|
||
|