699 并行排序 单调队列 [代码源][namomo spring camp]每日一题div1

连接
借鉴了代码，就喜欢短的。
怎么写一个nlogn的快速上升或者下降 严格或者不严格的子序列

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define f(i,a,n) for(int i=a;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define ll __int128

using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
// #define int __int128
// #define int long long
#define LL long long
#define dd double
const int N=1e6+5;
int n;
int arr[N];
inline void solve()
{
	int n;
    cin>>n;
    for(int i = 1; i <= n; i++) cin>>arr[i];
	reverse(arr+1,arr+1+n);
    vector<int> V;
    for(int i = 1; i <= n; i++){
        if(V.size() == 0) V.push_back(arr[i]);
        else{
            if(arr[i] >= V.back()) V.push_back(arr[i]);
            else *lower_bound(V.begin(),V.end(),arr[i]) = arr[i];
        }
    }
    cout<<V.size()<<endl;
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<< endl << "Time used:" << clock() - c1 << endl;
	return 0;
}