Print Maximum Increasing Subsequence

import java.util.Scanner;

public class Problem9 {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        String input = sc.nextLine();
        String[] numbersAsString = input.split(" ");
        int[] arr = new int[numbersAsString.length];
        int increaseCount = 0;
        int maxCount = 0;
        StringBuilder increasingSequence = new StringBuilder();
        StringBuilder maxSequence = new StringBuilder();

        for (int i = 0; i < arr.length; i++) {
            arr[i] = Integer.parseInt(numbersAsString[i]);
        }

        boolean isIncreasing = false;

        for (int i = 1; i < arr.length; i++) {
            int index = i-1;
            if(arr[i]> arr[index]){
                increaseCount++;
                isIncreasing = true;
                if(increaseCount==1){
                    increasingSequence.append(arr[index] + " " + arr[i]);
                }else if(increaseCount>1){
                    increasingSequence.append(" " + arr[i]);
                }
            }else{
                increaseCount = 0;
                increasingSequence.delete(0, increasingSequence.length());
            }

            if(maxCount<=increaseCount){
                maxCount = increaseCount;
                maxSequence.delete(0, maxSequence.length());
                maxSequence.append(increasingSequence);
            }

        }
        if(isIncreasing){
            System.out.println(maxSequence);
        }

    }
}