01-复杂度1 最大子列和问题 （20 分）

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

namespace TestConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            int.Parse(Console.ReadLine());

            var ls = Console.ReadLine().Split(‘ ‘);

            int max = 0, nowmax = 0;
            int x=0, y=0;
            int nowX = 0, nowY = 0;
            for(int i=0;i<ls.Length;i++)
            {
                nowX = 0;

                var item = ls[i];
                var temp = int.Parse(item);

                if(nowmax==0)
                {
                    nowX = i;
                }

                nowmax += temp;
                if(nowmax>0)
                {
                    nowY = i;
                    if (nowmax > max)
                    {
                        max = nowmax;
                        x = nowX;
                        y = nowY;
                    }
                }
                else
                {
                    nowmax = 0;
                }

            }

            Console.WriteLine(max);
        }
    }
}