using System;

using System.Collections.Generic;

​

public class Program

{

    public static void Main()

    {

        //Console.WriteLine("Hello World");

        //int[] array = new int[] {10, 5, 2, 7, 8, 7};

        //int k = 3;

        getMaxAlgoNew(new int[] {10, 5, 2, 7, 8, 7}, 3);

        Console.WriteLine("------");

        getMaxAlgoNew(new int[] {10, 5, 2, 7, 8, 7, 15, 12, 18, 4}, 4); // O(N^2) -- needs to be improved. 

    }

    private static void getMaxAlgoNew(int[] arr, int k) {

        for(int i=0; i <arr.Length - k + 1; i++) {

            arr[i] = getMax2(arr.AsMemory(i, k).ToArray());

            Console.WriteLine(arr[i]);

        }

    }

    private static int getMax2(int[] arr) {

        int max = arr[0];

        for(int i=0; i<arr.Length; i++) {

​

            if(arr[i] > max) {

                max = arr[i];

            }

        }

        return max;

    }

}

​

public class LittleMoreImprovedAlgo {

    private static void getMaxAlgoNew(int[] arr, int k) {

        for(int i=0; i <arr.Length - k + 1; i++) {

            arr[i] = getMax2(arr.AsMemory(i, k).ToArray(), k);

            Console.WriteLine(arr[i]);

        }

    }

    private static int getMax2(int[] arr, int k) {

        int max = arr[0];

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

​

            if(arr[i] > max) {

                max = arr[i];

            }

        }

        return max;

    }   

}

​

​

​

​

public class LittleImprovedAlg {

        private static void getMaxAlgoNew(int[] arr, int k) {

        for(int i=0; i <arr.Length - k + 1; i++) {

            arr[i] = getMax2(arr.AsMemory(i, k).ToArray(), k);

            Console.WriteLine(arr[i]);

        }

    }

    private static int getMax2(int[] arr, int k) {

        List<int> newArr = new List<int>();

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

            newArr.Add(arr[i]); 

        }

        return getArrayMax(newArr);

    }

    private static int getArrayMax(List<int> arr) {

        int max = arr[0];

        for(int i=1; i < arr.Count; i++) {

            if(arr[i] > max) {

                max = arr[i];

            }

        }

        return max;

    }

}

​

​

public class OldAlg {

    private static void getMaxAlgo(int[] arr, int k) {

        for(int i=0; i <arr.Length - k + 1; i++) {

            List<int> max = getMax(arr.AsMemory(i, k).ToArray(), k);

            printMax(max);

        }

    }

    private static List<int> getMax(int[] arr, int k) {

        List<int> newArr = new List<int>();

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

            newArr.Add(arr[i]); 

        }

        List<int> results = new List<int>();

        results.Add(getArrayMax(newArr));

        return results;

    }

    private static int getArrayMax(List<int> arr) {

        int max = arr[0];

        for(int i=1; i < arr.Count; i++) {

            if(arr[i] > max) {

                max = arr[i];

            }

        }

        return max;

    }

    private static void printMax(List<int> array) {

        for(int i=0; i<array.Count; i++) {

            Console.Write(array[i] + " ");

        }

        Console.WriteLine();

    }

}