10分，求dalao找错...

#include<iostream>
#include<cstdio>
#include<climits>
using namespace std;
const int Maxn=INT_MAX;
int high[100001];
int maxn=-99999,nowLen=1,minn=Maxn;
int tot,x[100001],k;
int main()
{
    int i=1,sum=1,j;
    while(~scanf("%d",&high[i])) i++;
    x[++tot]=high[1];
    int num=i;
    for(i=2;i<=num;i++)
    {
        if(high[i]<=high[i-1])
        {
            nowLen++;
            x[tot]=high[i];
        }
        else{
            maxn=max(maxn,nowLen);
            nowLen=1;
            for(j=1;j<=tot;j++)
                if(minn>x[j]&&x[j]>=high[i])
                {
                    k=j;
                    minn=x[j];
                }
            if(minn==Maxn)
            {
                sum++;
                x[++tot]=high[i];
            }
            else x[k]=high[i];
        }
    }
    cout<<maxn<<endl<<sum;
}