03. Largest Increasing Sequence

import java.util.Scanner;

public class LongestIncreasingSequence {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String input = in.nextLine();
        String[] array = input.split(" ");
        int[] numbers = new int[array.length];
        int counter = 1;
        int maxCounter = 1;
        int position = 0;

        // transform string array on int array
        for (int i = 0; i < array.length; i++) {
            numbers[i] = Integer.parseInt(array[i]);
        }

        // printig increasing sequence
        System.out.print(numbers[0]);
        for (int i = 1; i < numbers.length; i++) {
            if (numbers[i] > numbers[i - 1]) {
                System.out.print(" " + numbers[i]);
                counter++;
            }

            else {
                counter = 1;
                System.out.println();
                System.out.print(numbers[i]);
            }
            if (maxCounter < counter) {
                maxCounter = counter;
                position = i;
            }
        }
        // printing longest increasing sequence
        System.out.println();
        System.out.print("Longest: ");
        for (int j = 0; j < counter - 1; j++) {
            System.out.print(numbers[position - counter + 1 + j] + " ");
        }
        System.out.println(numbers[position]);

    }
}