hahaAll的博客

hdu3397Sequence operation：http://acm.hdu.edu.cn/showproblem.php?pid=3397 Sequence operation Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Desc

http://acm.hdu.edu.cn/showproblem.php?pid=3308 LCIS Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6448    Accepted Submission(s): 2799

UESTC360 Another LCIS:http://acm.uestc.edu.cn/#/problem/show/360 Another LCIS Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others) Submit  Status

Atlantis Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11407    Accepted Submission(s): 4841 Problem Description There are several an

线段树扫描线hdu1828Picture ：http://acm.hdu.edu.cn/showproblem.php?pid=1828 思路：求矩形周长并……可以把矩形分成横线和竖线两部分，并将两条横线和两条竖线都分别标记为-1、1。然后建两遍数，将结果相加就可以了（也有其他建一遍树的做法）……但这个题值得说的就是用这种做法有一个坑……将矩形的横线和竖线的坐标按照从小到大（从大到小）的顺序排序