ABC360G的795B短代码WAx1，码风不优良

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200010
int n,a[MAXN],h[MAXN],dp[MAXN],pre[MAXN];
inline int bin(int key){
	int l=0,r=n,mid=(l+r)>>1;
	while(l+1<r){
		if(a[h[mid]]<key) l=mid;
		else r=mid;
		mid=(l+r)>>1;
	}return l;
}inline int find(int id){
	if(!pre[id]) return id;
	return find(pre[id]);
}
int main(){
	cin>>n;
	for(int i=1;i<=n;++i) h[i]=n+1;h[0]=0,a[n+1]=1e9+1;
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=1;i<=n;++i){
		pre[i]=h[bin(a[i])],dp[i]=dp[pre[i]]+1;
		if(a[h[dp[i]]]>=a[i]) h[dp[i]]=i;
	}int pos=1;
	for(int i=2;i<=n;++i)if(dp[pos]<dp[i]) pos=i;
	int l=find(pos);
	if(pos<n||l>1){cout<<dp[pos]+1<<endl;return 0;}
	if(a[pos]-a[l]+1==dp[pos]||pos-l+1==dp[pos]) cout<<dp[pos]<<endl;
	else cout<<dp[pos]+1<<endl;
	return 0;
}