hdu 1257 WA

#include<cctype>#include<cmath>#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<string>#include<queue>#include<stack>#include<set>#include<map>#define REP(i,a,b) for (i=(a);i<=(b);i++)#define CLEAR(a) memset((a),0,sizeof((a)))using namespace std;typedef long long LL;const double pi = acos(-1.0);const int maxn=1e3;const int inf=99999999;int dp[maxn],h[maxn];int maxh,len,n;void init();void solve();void outp();int main(){    while (~scanf("%d",&n))        {            init();            solve();            outp();        }    return 0;}void solve(){    for(int i=1;i<=n;i++)        for(int j=1;j<=len;j++)            if (h[i]>maxh) maxh=dp[len++]=h[i];}void init(){    CLEAR(dp);CLEAR(h);    maxh=0;len=1;    for(int i=1;i<=n;i++)    {        cin>>h[i];    }}void outp(){    cout<<len;}