rt（其实以前就这样）

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<cctype>
#include<vector>
#include<utility>
#include<queue>
#include<map>
#include<set>
#include<ctime>
#include<deque>
#include<fstream>
#include<cstdlib>
using namespace std;
typedef long long l;
const int maxn=100000;
const int inf=999999999;
const int mod=1000000007;
int a[maxn],cnt=1,ans,ans2,tree[maxn],ready_tree[maxn],max_num;
void protect_top2(int x,int y){
	for(int i=x;i<=max_num;i+=i&-i){
		ready_tree[i]=max(ready_tree[i],y);
	}
}
int list2(int x){
	int y=0;
	for(int i=x;i>=1;i-=i&-i){
		y=max(y,ready_tree[i]);
	}
	return y;
}
void protect_top(int x,int y){
	for(int i=x;i>=1;i-=i&-i){
		tree[i]=max(tree[i],y);
	}
}
int list(int x){
	int y=0;
	for(int i=x;i<=max_num;i+=i&-i){
		y=max(y,tree[i]);
	}
	return y;
}
int main(){
	while(scanf("%d",&a[cnt])!=EOF){  
        max_num=max(max_num,a[cnt]);
        cnt++;
    }
    cnt--;
	for(int i=1;i<=cnt;i++){
		int sum=list(a[i])+1;
		protect_top(a[i],sum);
		ans=max(ans,sum);
	}
	for(int i=1;i<=cnt;i++){
		int sum=list2(a[i])+1;
		protect_top2(a[i]+1,sum);
		ans2=max(ans2,sum);
	}
	if(ans) cout<<ans<<endl;
	if(ans2) cout<<ans2;
	return 0;
}