LongestIncreasingSubsequence SoftUni

import java.util.Scanner;
class LongestSequence {
    public static void main (String[] args) throws java.lang.Exception  {
    Scanner sc = new Scanner(System.in);
    String[] array1 = sc.nextLine().split(" ");
    int[] numbers = new int[array1.length];
    for(int i = 0; i < array1.length; i ++){
        numbers[i] = Integer.parseInt(array1[i]);
    }
    int maxLength = 0;
            int lastIndex = -1;
            int[] len = new int[numbers.length];
            int[] previous = new int[numbers.length];

            for (int i = 0; i < numbers.length; i++) {
                len[i] = 1;
                previous[i] = -1;

                for (int k = 0; k < i; k++) {
                    if (numbers[k] < numbers[i] && len[k] + 1 > len[i]) {
                        len[i] = len[k] + 1;
                        previous[i] = k;
                    }
                }

                if (len[i] > maxLength) {
                    maxLength = len[i];
                    lastIndex = i;
                }
            }

            int[] lis = new int[maxLength];
            int currentIndex = maxLength - 1;

            while (lastIndex != -1)  {
                lis[currentIndex] = numbers[lastIndex];
                currentIndex--;
                lastIndex = previous[lastIndex];
            }
 for(int print = 0; print < lis.length; print++){
            System.out.print(lis[print] + " ");
        }
    }
    }