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.
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
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 file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
7 1 7 3 5 9 4 8
4
分析:
又是最长上升子序列的模板题,套模板即可
import java.util.*;
public class Main {
static Scanner in = new Scanner(System.in);
static int[] dp = new int[1005];;
static int[] a = new int[1005];
static int n;
public static void main(String[] args) {
while(in.hasNext()){
n = in.nextInt();
for(int i=1;i<=n;i++) a[i]=in.nextInt();
int ans=0;
for(int i=1;i<=n;i++){
dp[i]=1;
for(int j=1;j<i;j++){
if(a[j]<a[i])
dp[i]=Math.max(dp[i], dp[j]+1);
}
ans = Math.max(dp[i], ans);
}
System.out.println(ans);
}
}
}
水水。。