codevs1044：dilworth定理

#include<stdio.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[30010];
int a[30010];
int n;
int LIS()
{
    memset(dp,0,sizeof(dp));
    int k=0;
    dp[k++]=a[0];
    for(int i=1; i<n; i++)
    {
        if(a[i]>=dp[k-1])
        {
            dp[k++]=a[i];
            continue;
        }
        int t=lower_bound(dp,dp+k,a[i])-dp;
        dp[t]=a[i];
    }
    return k;
}
int main()
{

    n=0;
    while(scanf("%d",a+(n++))!=EOF);
    n--;
    int ans2=LIS();
    reverse(a,a+n);
    int ans1=LIS();
    cout<<ans1<<endl<<ans2<<endl;
    return 0;
}