Maximum subarray sum (Kadane) #50

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main()
    {
        int[] a = { 1, 2, 3, 4, 5, 6, -6 };
        int best = a[0], cur = a[0];
        for (int k = 1; k < a.Length; k++) {
            cur = Math.Max(a[k], cur + a[k]);
            best = Math.Max(best, cur);
        }
        Console.WriteLine(best);
    }
}