|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|25 초||512 MB||48||8||7||23.333%|
Consider a circle divided into 106 arcs numbered clockwise from 1 to 106. Moreover, there are n segments on the circle, each spanning a connected interval of arcs.
Find the size of the largest set of segments such that every two share at least one common arc.
The first line of input contains the number of test cases z. The descriptions of the test cases follow.
The first line of each test case contains the number of segments n (1 ≤ n ≤ 3000). The following n lines contain two integers li and ri (1 ≤ li, ri ≤ 106) – the first and last arc of the i-th segment if we traverse the circle clockwise. No segment contains the entire circle, and no two segments coincide.
The sum of n over all test cases does not exceed 24000.
For each test case, output a single line containing a single integer – the size of the largest set of segments such that every two of them intersect.
1 4 1 4 4 5 5 2 3 3