Ex08SequenceMaxSum

// Write a program that finds the sequence of maximal sum in given array. Example:
//	{2, 3, -6, -1, 2, -1, 6, 4, -8, 8}  {2, -1, 6, 4}

using System;

class Ex08SequenceMaxSum
{
    static void Main(string[] args)
    {

        int[] arr = { 2, 3, -6, -1, 2, -1, 6, 4, -8, 8 };
        int maxSum = 0;
        int currentSum = 0;
        int startIndex = 0;
        int endIndex = 1;
        for (int i = 0, j = 0; i < arr.Length; i++)
        {
            if (arr[j] <= 0)
                j++;
            else if (currentSum + arr[i] > maxSum)
            {
                currentSum += arr[i];
                maxSum = currentSum;
                startIndex = j;
                endIndex = i;
            }
            else if ((i < arr.Length - 1) && (arr[i] + arr[i + 1] > 0))
                currentSum += arr[i];
            else
            {
                currentSum = 0;
                i = j;
                j++;
            }
        }

        Console.WriteLine(maxSum);
        for (int i = startIndex; i <= endIndex; i++)
        {
            Console.Write(arr[i] + " ");
        }
    }
}