02.09.02.02.LongestIncreasingOrder

using System;
using System.Collections.Generic;
using System.Text;

class LongestIncreasingOrder
{
    static int[] ConvertToInt(string[] arrayToConvert)
    {
        int[] numbArray = new int[arrayToConvert.Length];

        for (int i = 0; i < arrayToConvert.Length; i++)
        {
            numbArray[i] = int.Parse(arrayToConvert[i].Trim());
        }
        return numbArray;
    }

    static int FindTheSteps(int[] numbersdArray)
    {
        int maxStep = (numbersdArray.Length) / 2; // + / - (moje da se namali)
        int counter = 1;
        int maxCounter = -1;

        // moving forwards
        for (int numbs = 0; numbs < numbersdArray.Length; numbs++)
        {
            for (int i = 1; i <= maxStep; i++)
            {
                int temp = numbersdArray[numbs];
                counter = 1;
                for (int j = numbs + i; j < numbersdArray.Length + numbs; j = j + i)
                {
                    if (j >= numbersdArray.Length)
                    {
                        j = j - numbersdArray.Length;
                    }
                    if (temp < numbersdArray[j])
                    {
                        counter++;
                    }
                    if (maxCounter < counter)
                    {
                        maxCounter = counter;
                    }
                    if (temp >= numbersdArray[j])
                    {
                        counter = 1;
                        break;
                    }
                    temp = numbersdArray[j];
                }
            }
        }

        // moving backwards

        //for (int numbs = numbersdArray.Length - 1; numbs >= 0; numbs--)
        //{
        //    for (int i = 1; i <= maxStep; i++)
        //    {
        //        int temp = numbersdArray[numbs];
        //        counter = 1;
        //        for (int j = numbersdArray.Length + numbs - i; j >= 0; j = j - i)
        //        {
        //            if (j >= numbersdArray.Length)
        //            {
        //                j = j - numbersdArray.Length;
        //            }
        //            if (temp < numbersdArray[j])
        //            {
        //                counter++;
        //            }
        //            if (maxCounter < counter)
        //            {
        //                maxCounter = counter;
        //            }
        //            if (temp >= numbersdArray[j])
        //            {
        //                counter = 1;
        //                break;
        //            }
        //            temp = numbersdArray[j];
        //        }
        //    }
        //}

        return maxCounter;
    }


    static void Main()
    {
        string input = Console.ReadLine();

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < 2; i++)
        {
            sb.Append(input + ", ");
        }
        string usedInput = sb.ToString();
        usedInput = usedInput.TrimEnd(',', ' ');
        //string usedInput = input + ", " + input;

        string[] splitInput = usedInput.Split(new char[] { ',' }, StringSplitOptions.RemoveEmptyEntries);
        int[] splitedNumbers = ConvertToInt(splitInput);

        int exitSteps = FindTheSteps(splitedNumbers);
        Console.WriteLine(exitSteps);

    }
}