Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class LDS {
- private static int najdolgaOpagackaSekvenca(int[] a) {
- int [] lista=new int[a.length];
- for(int i = 0 ; i < a.length ; i ++){
- lista[i]=1;
- // System.out.print(lista[i]);
- }
- for(int i = 1 ; i < a.length ; i ++){
- for(int j = 0 ; j < i ; j ++){
- if(a[i]< a[j] &&lista[i] < lista[j]+1){
- lista[i]=lista[j]+1;
- }
- }
- }
- int min=Integer.MIN_VALUE;
- for(int i = 0 ; i < lista.length ; i++){
- if(min<lista[i]){
- min=lista[i];
- }
- }
- return min;
- }
- public static void main(String[] args) {
- Scanner stdin = new Scanner(System.in);
- int n = stdin.nextInt();
- int a[] = new int[n];
- for (int i = 0; i < a.length; i++) {
- a[i] = stdin.nextInt();
- }
- System.out.println(najdolgaOpagackaSekvenca(a));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement