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

/*Напишете програма, която намира последователност от числа, чиито сума е максимална.
 * Пример: {2, 3, -6, -1, 2, -1, 6, 4, -8, 8} ---> 11 */
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace _9_Exercise
{
    class Program
    {
        static void Main(string[] args)
        {

            Console.Write("Enter array length: ");
            int length = int.Parse(Console.ReadLine());
            int[] myArray = new int[length];

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

            int currentSum = 0;
            int bestSum = 0;
            StringBuilder bestSequenceBuild = new StringBuilder();
            string bestSequence = "";
            for (int i = 0; i < myArray.Length; i++)
            {
                currentSum = currentSum + myArray[i]; // currentSum += myArray[i];
                bestSequenceBuild.AppendFormat("{0}, ", myArray[i]);
                if (currentSum > bestSum)
                {
                    bestSum = currentSum;
                    bestSequence = bestSequenceBuild.ToString();
                }
                if (currentSum < 0)
                {
                    currentSum = 0;
                    bestSequenceBuild.Clear();
                }
            }
            Console.WriteLine();
            Console.WriteLine("The best sequence is: {0} ", bestSequence);
            Console.WriteLine("The best sum is: {0} ", bestSum);
        }
    }
}