POJ2533 Longest Ordered Subsequence[최장 증자 서열]

Longest Ordered Subsequence
Time Limit: 2000MS
 
Memory Limit: 65536K
Total Submissions: 32192
 
Accepted: 14093
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

NYOJ 원제

#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", ans); return 0; }