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