| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 128 MB | 59 | 39 | 37 | 66.071% |
Given n open intervals (a1, b1), (a2, b2), ..., (an, bn) on the number line, each representing start and end times of some activity requiring the same resource, the goal is to find the largest number of these intervals so that no two of them overlap.
The input will contain multiple test cases. Each test case starts with a single line containing a positive integer, n ≤ 50, indicating the number of intervals. The next n lines each contain a pair of positive integers separated by one or more blanks. Each pair of integers represents one interval. The end-of-input is denoted by a line containing 0.
For each test case print the largest number of intervals that do not overlap.
5 10 12 2 6 5 8 3 9 1 4 2 1 3 3 5 0
3 2
School > PLU High School Programming Contest > PLU 2013 > Advanced 11번