-
Notifications
You must be signed in to change notification settings - Fork 0
/
1078.cpp
57 lines (52 loc) · 1.24 KB
/
1078.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct segment{
int num;
int start=10001;
int end=-10001;
};
bool compare(segment a, segment b){
if (a.start == b.start)
return a.end < b.end;
return a.start < b.start;
}
int main(){
int N;
int count=0;
segment arr[500];
vector <int> tmpR(500);
vector <int> tmpL(500);
//input
cin >> N;
for (int i = 0; i < N; i++){
arr[i].num = i+1;
cin >> arr[i].start >> arr[i].end;
}
sort(arr, arr + N, compare);
for (int i = 0; i < N; i++){
//binsearch
int left = 0, maxR = arr[i].end, right = count, middle;
while(left <= right )
{
middle = (left + right) / 2;
if(tmpR[middle] > maxR)
left = middle + 1;
else
right = middle - 1;
}
tmpR[left] = maxR;
tmpL[i] = left;
count = max(count, left);
}
//output
cout << count+1 << endl;
for(int i = N - 1; i >= 0; i--){
if(tmpL[i] == count && arr[i].end != -10001){
cout << arr[i].num << ' ';
count--;
}
}
return 0;
}