#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int f[100005],n=1,m[100005],maxn=0;
void init()
{
for (int i=1;i<=n;i++){
f[i]=1;
}
maxn=0;
}
int main()
{
//freopen("1.in","r",stdin);
while (scanf("%d",&m[n])!=EOF){
n++;
}
n--;
init();
for (int i=1;i<=n;i++){
for (int j=1;j<i;j++){
if (m[i]<=m[j]){
f[i]=max(f[i],f[j]+1);
maxn=max(maxn,f[i]);
}
}
}
cout<<maxn<<endl;
init();
for (int i=1;i<=n;i++){
for (int j=1;j<i;j++){
if (m[i]>m[j]){
f[i]=max(f[i],f[j]+1);
maxn=max(maxn,f[i]);
}
}
}
cout<<maxn<<endl;
}
NOIP 1999导弹拦截
最新推荐文章于 2024-03-01 21:13:17 发布