全部RE，本机运行是对的

#include<bits/stdc++.h>
using namespace std;
int f_more[100001],f_less[100001];
int volun[100001],n=1;
void behigher(int nown);
void belower(int nown);
int main(){
	while(scanf("%d",&volun[n])){
		f_more[n]=1;f_less[n]=1;
		n++;
	}
	behigher(1);
	belower(1);
	int high=0,low=0;
	for(int i=1;i<=n;i++){
		high=max(high,f_more[i]);
		low=max(low,f_less[i]);
	}
	printf("%d\n%d",low-1,high);
	return 0;
}
void behigher(int nown){
	for(int i=nown;i<=n;i++){
		for(int u=i-1;u>0;u--){
			if(volun[i]>volun[u]){
				f_more[i]=max(f_more[i],f_more[u]+1);			 
			}
		}
	}
	return ;
}
void belower(int nown){
	for(int i=nown;i<=n;i++){
		for(int u=i-1;u>0;u--){
			if(volun[i]<=volun[u]){
				f_less[i]=max(f_less[i],f_less[u]+1);
			}
		}
	}
	return ;
}