Insistor

Subsequence Time Limit:1000MS Memory Limit:65536K Total Submissions:24441 Accepted:10320 Description A sequence of N positive integers (10 < N < 100 000), each of them ...

Jessica's Reading Problem Time Limit:1000MS Memory Limit:65536K Total Submissions:19047 Accepted:6552 Description Jessica's a very lovely girl wooed by lots of boys. Recently...

Sum of Consecutive Prime Numbers Time Limit:1000MS Memory Limit:65536K Total Submissions:29814 Accepted:15916 Description Some positive integers can be represented by a sum o...

Graveyard Design Time Limit:10000MS Memory Limit:64000K Total Submissions:9686 Accepted:2462 Case Time Limit:2000MS Description King George has recently decided that he wo...

Bound Found Time Limit:5000MS Memory Limit:65536K Total Submissions:6980 Accepted:2277 Special Judge Description Signals of most probably extra-terrestrial origin hav...

尺取法：顾名思义，像尺子一样取一段，借用挑战书上面的话说，尺取法通常是对数组保存一对下标，即所选取的区间的左右端点，然后根据实际情况不断地推进区间左右端点以得出答案。之所以需要掌握这个技巧，是因为尺取法比直接暴力枚举区间效率高很多，尤其是数据量大的时候，所以尺取法是一种高效的枚举区间的方法，一般用于求取有一定限制的区间个数或最短子序列等等。当然任何技巧都存在其不足的地方，有些情况下尺取法不可行，无...