导弹拦截

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
int ans1,ans2;
int a[110];
int n=0;
int maxlen1[120],maxlen2[120];
int main()
{
while(scanf("%d",&a[++n])!=EOF)
for(int i=1; i<=n; i++)
{
for(int j=1; j<i; j++)
{
if(a[i]<a[j])
{
maxlen1[i]=max(maxlen1[i],maxlen1[j]+1);
}
if(a[i]>=a[j])
{
maxlen2[i]=max(maxlen2[i],maxlen2[j]+1);
}
}
}
for(int i=1; i<=n; i++)
{
ans1=max(ans1,maxlen1[i]);
ans2=max(ans2,maxlen2[i]);
}
printf("%d\n%d",ans1+1,ans2+1);
return 0;
}