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 []vrednosti=new int[a.length];
- int najdolga=1;
- for (int i=0; i<a.length; i++){
- vrednosti[i]=1;
- for (int j=0; j<i; j++){
- if (a[j]>a[i]){
- if(vrednosti[j]==vrednosti[i])
- vrednosti[i]=vrednosti[j]+1;
- if (najdolga<vrednosti[i]) najdolga=vrednosti[i];
- }
- }
- }
- return najdolga;
- }
- 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