一道数组求连续子集最大值的题目。

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

namespace SumMax
{
    class Program
    {
        public int[] Sum_Max(int[] array)
        {
            int sum = 0;
            int max = array[0];
            int i = 0;
            int index_start = i;
            int index_end = i;
            int index_temp = 0;

            for (i = 0; i < array.Length;i++ )
            {
                if (sum >= 0)///Sum if the result >= 0.
                {
                    sum += array[i];
                }
                else   ///A new sum if the result of sum < 0 and a new start for the new array
                {
                    sum = array[i];
                    index_temp = i;
                }
                if (sum > max)  ///Compare the max and result of sum and set the index end if sum > max
                {
                    max = sum;
                    index_end = i;
                }
                if (index_temp <= index_end) ///if Temp < end, start should be changed
                {
                    index_start = index_temp;
                }
            }

            /// create the result to be a new array
            int[] result = new int [index_end - index_start + 1];
            for (int index = 0; index < result.Length; index++)
            {
                result[index] = array[index_start++];
            }

            return result;
        }

        static void Main(string[] args)
        {
            int[] array = { 2, 3, -6, 10, 50, 80, -100, -200, 50}; /// a test case

            Program p = new Program();

            int[] resultArray = p.Sum_Max(array);
            int sum = 0;
            foreach (int a in resultArray)
            {
                sum += a;
                Console.Write(a + ", ");
            }
            Console.WriteLine();
            Console.Write(sum);

            Console.ReadLine();
        }
    }
}