样例过了，但是好多点第一问wa了，求助```

#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;

const int maxn = 50050 ; 

int l , len , a[maxn] , b1[maxn] , b2[maxn] , c[maxn] ;

int main(){
	int ans1 = -1 , ans2 = -1 ;
	while(scanf("%d" , &a[l]) == 1)	l++ ;
	for(int i = 0 ; i < l ; ++i){
		b2[i] = 1 ;
		for(int j = 0 ; j < i ; ++j){
			if(a[i] < a[j])
				b2[i] = max(b2[i] , b2[j] + 1) ;
		}
	}
	for(int i = 0 ; i <= l ; i++){
		ans2 = max(ans2 , b2[i]) ;
	}
	cout<<ans2<<endl;
	for(int i = 0 ; i < l ; i++){
		b1[i] = 1 ; 
		for(int j = 0 ; j < i ; j++){
				if(a[i] > a[j])
					b1[i] = max(b1[i] , b1[j] + 1) ;
		}
	}
	for(int i = 0 ; i < l ; i++){
		ans1 = max(ans1 , b1[i]) ;
	}
	cout<<ans1;
	return 0 ;
}