MSTICK - Wooden Sticks
Tác giả: happyboy99x
Ngôn ngữ: C++
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MXV = 10000, N = 5000;
pair<int, int> a[N];
int n, lst[N];
void enter() {
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%d%d", &a[i].first, &a[i].second);
}
void solve() {
sort(a, a+n);
int maxlen = 1; lst[0] = a[n-1].second;
for(int i = n-2; i >= 0; --i) {
int dp = lower_bound(lst, lst+maxlen, a[i].second) - lst;
if(dp == maxlen) ++maxlen, lst[dp] = a[i].second;
else lst[dp] = min(lst[dp], a[i].second);
}
printf("%d\n", maxlen);
}
int main() {
int tc; scanf("%d", &tc);
while(tc--) enter(), solve();
return 0;
}