Problem 5

import java.util.Arrays;

public class Problem4 {

    public static void main(String[] args) {

        int [] array = {5, 1, 2, 3, 4, 8, 4, 5, 6, 5};

        int bestSubArr = 1;
        int subArr = 1;
        int number = 0;
        int position = 0;
        int bestPosition = 0;
        int startPosition = 0;


        for (int i = 0; i < array.length - 1; i++){
            if (array[i] == array[i + 1] - 1){
                subArr++;
                position = i;
            }else {
                subArr = 1;
                position = 0;
            }
            if (subArr > bestSubArr){
                bestSubArr = subArr;
                bestPosition = position;
            }

        }
        startPosition = bestPosition + 2 - bestSubArr;
        number = array[startPosition];

        System.out.println("The sub array starts frpm "
                + startPosition + "th position");
        System.out.println("The longest sub array is "
                + bestSubArr + " elements ");
        System.out.println("The first element of the sub array is : "
                + number);

        int[] array1 = new int[bestSubArr];

        for (int i = 0; i < bestSubArr; i++){
            array1[i] = number++;
        }

        System.out.println(Arrays.toString(array1));

    }

}