#BZOJ4130. Kangaroos
-
ID: 2712
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
root
Kangaroos
No submission language available for this problem.
题目描述
定义两个区间互相匹配表示这两个区间有交集。
给出长度为N的区间序列A,M次询问，每次询问序列A中最长的连续子序列，使得子序列中的每个区间都与[L,R]互相匹配
N<=50000,M<=200000
3 3
2 5
1 3
6 6
3 5
1 10
7 9
2
3
0