dp都能t

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n=1,ans1,ans2;
ll a[100005];
ll dp1[100005],dp2[100005];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	while(cin>>a[n]){
		dp1[n]=1;
		dp2[n]=1;
		n++;
	}
	for(int i=2;i<n;i++){
		for(int j=1;j<i;j++){
			if(a[i]<=a[j])dp1[i]=max(dp1[i],dp1[j]+1);
			else dp2[i]=max(dp2[i],dp2[j]+1);
		}
		ans1=max(ans1,dp1[i]);
		ans2=max(ans2,dp2[i]);
	}
	cout<<ans1<<endl<<ans2;
	return 0;
}