Poj2533 longest ordered subsequence [longest incrementing subsequence]

Longest ordered subsequence

Time limit:2000 ms		Memory limit:65536 K
Total submissions:32192		Accepted:14093

Description

A numeric sequence AIIs 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 other 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

71 7 3 5 9 4 8

Sample output

4

Nyoj original question

#include <stdio.h>int arr[1002], dp[1002];int main(){    int n, i, j, ans;    scanf("%d", &n);    for(i = 1; i <= n; ++i) scanf("%d", arr + i);    dp[1] = ans = 1;    for(i = 2; i <= n; ++i){        for(dp[i] = 1, j = i - 1; j >= 1; --j){            if(arr[i] > arr[j] && dp[i] <= dp[j]){                dp[i] = dp[j] + 1;                if(dp[i] > ans) ans = dp[i];            }        }    }    printf("%d\n", ans);    return 0;}

Poj2533 longest ordered subsequence [longest incrementing subsequence]