[C#] BOOK Arrays - 5 Задача

/* Write a program that finds the maximal increasing sequence in an array. Example: {3, 2, 3, 4, 2, 2, 4} ---> {2, 3, 4}. */

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace _5_Exercise
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.Write("Enter array length: ");
            int m = int.Parse(Console.ReadLine());
            int[] testArray = new int[m];

            //enter array elements
            for (int i = 0; i < testArray.Length; i++)
            {
                Console.Write("Number {0} = ", i + 1);
                testArray[i] = int.Parse(Console.ReadLine());
            }

            List<int> maximumSeqArray = new List<int>();
            int start = 0;
            int length = 1;
            int bestStart = 0;
            int bestLength = 1;

            for (int i = 0; i < testArray.Length - 1; i++)
            {
                if (testArray[i] < testArray[i + 1])
                {
                    length++;

                    if (length > bestLength)
                    {
                        bestLength = length;
                        bestStart = start;
                    }
                }
                else
                {
                    length = 1;
                    start = i + 1;
                }
            }

            int NumberOfElement = 1;
            Console.WriteLine();
            Console.WriteLine("Maximal increasing sequence in an array : ");
            for (int n = bestStart; n < bestStart + bestLength; n++)
            {
                maximumSeqArray.Add(testArray[n]);
                Console.WriteLine("element {0} : {1}", NumberOfElement, testArray[n]);
                NumberOfElement++;
            }
        }
    }
}