题解:
先考虑暴力的O(n ^ 2)的dp,那么有 d p [ i ] = m a x ( d p [ j ] + 1 ) dp[i] = max(dp[j] + 1) dp[i]=max(dp[j]+1) i f ( j < i & & x [ j ] < x [ i ] & & y [ j ] < y [ i ] ) if(j < i \ \&\& \ \ x[j] < x[i] \ \&\& \ \ y[j] < y[i]) if(j<i && x[j]<x[i] && y[j]<y[i])
发现只需要知道前面满足条件的dp[j]就能快速转移
三维偏序问题,考虑CDQ分治,首先对 id 进行排序,再分别将左右区间按照 x 进行排序,那么对于右区间的每个值,找到一个区间满足左区间的所有 x 小于它的 x,现在左区间的 id 和 x 对于右区间的点对都是满足前两个条件的,因此我们只需要将左区间的 y 值加到树状数组中,然后右区间查询 y 值比它小的最大 dp 值即可
注意应该递归左区间,再用左区间的 dp 值更新右区间,再递归右区间,用右区间的 dp 值更新右区间
代码:
/*
* @Author : Nightmare
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define ls 2 * rt
#define rs 2 * rt + 1
#define PII pair<int,int>
#define PDD pair<double, double>
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x & (-x))
const int N = 1e5 + 5;
const int M = 2e5 + 5;
const int mod = 1e9 + 7;
int n, m, bit[M], dp[M]; vector<int> vec;
struct node{ int x, y, id; }a[N];
bool cmpid(node a, node b){ return a.id < b.id; }
bool cmpx(node a, node b){ return a.x < b.x; }
void add(int x, int v){ while(x <= m) bit[x] = max(bit[x], v), x += lowbit(x); }
void setup(int x, int v){ while(x <= m) bit[x] = 0, x += lowbit(x); }
int query(int x, int res = 0){ while(x) res = max(res, bit[x]), x -= lowbit(x); return res; }
void CDQ(int l, int r){
if(l == r) return ; int mid = (l + r) >> 1;
CDQ(l, mid);
sort(a + l, a + mid + 1, cmpx);
sort(a + mid + 1, a + r + 1, cmpx);
for(int i = mid + 1, L = l ; i <= r ; i ++){
while(L <= mid && a[L].x < a[i].x) add(a[L].y, dp[a[L].id]), L ++;
dp[a[i].id] = max(dp[a[i].id], query(a[i].y - 1) + 1);
}
for(int i = l ; i <= r ; i ++) setup(a[i].y, 0);
sort(a + l, a + r + 1, cmpid);
CDQ(mid + 1, r);
}
void solve(){
scanf("%d", &n);
for(int i = 1 ; i <= n ; i ++) scanf("%d %d", &a[i].x, &a[i].y), a[i].id = i;
for(int i = 1 ; i <= n ; i ++) vec.push_back(a[i].y);
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
m = vec.size();
for(int i = 1 ; i <= n ; i ++) a[i].y = lower_bound(vec.begin(), vec.end(), a[i].y) - vec.begin() + 1;
sort(a + 1, a + n + 1, cmpid);
for(int i = 1 ; i <= n ; i ++) dp[i] = 1;
CDQ(1, n); int ans = 0;
for(int i = 1 ; i <= n ; i ++) ans = max(ans, dp[i]);
printf("%d\n", ans);
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("E:\\in.txt", "r", stdin);
#endif
solve();
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}