初步学习中……
类型一:单点更新,区间查询
敌兵布阵 :http://acm.hdu.edu.cn/showproblem.php?pid=1166 求和
题解: http://blog.csdn.net/feng_zhiyu/article/details/77034271
I Hate It :http://acm.hdu.edu.cn/showproblem.php?pid=1754 求最大值
题解: http://blog.csdn.net/feng_zhiyu/article/details/77033572
Minimum Inversion Number: http://acm.hdu.edu.cn/showproblem.php?pid=1394 求逆序数
题解:http://blog.csdn.net/feng_zhiyu/article/details/76278820
类型二:区间更新
A Simple Problem with Integers: http://poj.org/problem?id=3468 求和
题解: http://blog.csdn.net/feng_zhiyu/article/details/77043347
Just a Hook:http://acm.hdu.edu.cn/showproblem.php?pid=1698 将某区间内的数置为一个值,求总和
题解:http://blog.csdn.net/feng_zhiyu/article/details/77044357
类型三:区间合并
类型四:扫描线,离散化技术
某大牛习题总结:
http://blog.csdn.net/shiqi_614/article/details/8228102