Longest Ordered Subsequence 最长上升子序列

Longest Ordered Subsequence
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).

Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7
1 7 3 5 9 4 8
Sample Output

4

#include
#include
#include
using namespace std;
int a[1010];
int dp[1010];
int main()
{
    int n;
   // freopen("in.txt","r",stdin);
    while(~scanf("%d",&n))
    {
     for(int i=0;ia[j]) dp[i]=max(dp[i],dp[j]+1);
           else if(a[i]==a[j]) dp[i]=max(dp[i],dp[j]);
          }
         ans=max(ans,dp[i]);
     }
     printf("%d\n",ans);
    }
}