P1233 木棍加工https://www.luogu.com.cn/problem/P1233
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
typedef pair<int, int> P;
P s[MAXN];
int d[MAXN];
int main() {
int n;
scanf("%d", &n);
int x, y;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x, &y);
s[i] = make_pair(x, y);
}
sort(s + 1, s + n + 1, greater<P>() );
/*
for (int i = 1; i <= n; i++) {
printf("%d %d\n", s[i].first, s[i].second);
}*/
int ans = 0;
for (int i = 1; i <= n; i++) {
d[i] = 1;
for (int j = 1; j < i; j++) {
if (s[i].second > s[j].second) {
d[i] = max(d[i], d[j] + 1);
}
}
ans = max(d[i], ans);
}
printf("%d", ans);
return 0;
}