令b[]为原序列,a[i]为修改过程中b[i]被修改到的历史最大值,c[i]为历史最小值
原题可转化为求最长的子序列,满足对于任意两项
i
,
这东西好像叫二维偏序,反正拿CDQ分治能求就是了
一维排序二维树状数组,因为树状数组已经有一个log了所以排序直接上快排也不会有很大影响
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 100050
using namespace std;
inline void utax(int &x,int y) { x = max(x,y); }
inline void utin(int &x,int y) { x = min(x,y); }
struct Monster{ int a,b,c,rank,ans; }Q[N];
bool cmpc(Monster p1,Monster p2) { return p1.c < p2.c; }
bool cmpb(Monster p1,Monster p2) { return p1.b < p2.b; }
bool cmpr(Monster p1,Monster p2) { return p1.rank < p2.rank; }
int n,m,ans,tp;
struct BIT{
int tr[N];
int lowbit(int x) { return x & (-x); }
void add(int x,int v) {
for (int i=x;i<=tp;i+=lowbit(i)) utax(tr[i],v);
}
int ask(int x) {
int ret = 0;
for (int i=x;i;i-=lowbit(i)) utax(ret,tr[i]);
return ret;
}
void clear(int x) {
for (int i=x;i<=tp;i+=lowbit(i)) tr[i] = 0;
}
}T;
void solve(int l,int r) {
if (l == r) return utax(ans , Q[l].ans);
int mid = (l + r) >> 1;
solve(l,mid);
sort(Q+mid+1,Q+r+1,cmpc);
for (int i=mid+1,j=l-1;i<=r;i++) {
while (j+1 <= mid && Q[j+1].b <= Q[i].c)
j++ , T.add( Q[j].a , Q[j].ans );
utax( Q[i].ans , T.ask(Q[i].b)+1 );
}
sort(Q+mid+1,Q+r+1,cmpr);
for (int i=l;i<=mid;i++) T.clear( Q[i].a );
solve(mid+1,r);
sort(Q+l,Q+r+1,cmpb);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) {
scanf("%d",&Q[i].b);
Q[i].a = Q[i].c = Q[i].b , Q[i].ans = 1;
Q[i].rank = i;
utax(tp,Q[i].c);
}
for (int i=1;i<=m;i++) {
int x,v; scanf("%d%d",&x,&v);
utax(Q[x].a,v); utin(Q[x].c,v);
}
solve(1,n);
printf("%d\n",ans);
return 0;
}