static int solve(int numbers[], int N, int K) {

       int[][] array = new int[N][K];
       int max = Integer.MIN_VALUE;

       for (int i = 0 ; i < N ; i++) {

           for (int j = 1 ; j < K ; j++) {

               for (int k = 0 ; k < N ; k++) {

                   array[i][j] = Math.max(array[i][j]
                           ,array[i][j - 1] + Math.abs(numbers[i] - numbers[k]));

                   max = Math.max(max, array[i][j]);

               }

           }

       }
        return max;
    }