首尾相接整数数组中最大子数组的和

#include<iostream>
using namespace std;
#include<vector> 

int main()
{
    int i,len;
    int max0=0,max1=0,sum=0,min=0,sum0 = 0;
    cout<<"请输入数组长度;";
    cin>>len;
    int *array = new int[len]; 
    cout<<"请输入数组内容："<<endl;
    for(i=0;i<len;i++) 
    {
        cin>>array[i];
    }

    for(i=0;i<len;i++)
    {
        sum = sum + array[i];

        if(sum<0)
        {
            sum = 0;
        }
        if(sum>max1)
        {
            max1 = sum;
        }
    }

    for(i=0;i<len;i++)
    {
        sum = sum + array[i];
        if(sum>0)
        {
            sum = 0;
        }
        if(sum<min)
        {
            min = sum;
        }
    }

    for(i=0;i<len;i++)
    {
        sum0 = sum0 + array[i];
    }

    max0 = sum0-min;

    if(max1 == 0)
    {
        max1 = array[0];
        for(i=1;i<len;i++)
        {
            if(array[i]>max1)
            {
                max1 = array[i];
            }
        }
        cout<<"最大子数组和为"<<max1<<endl;
    }
    else
    {
        if(max0>max1)
        {
            cout<<"最大子数组和为"<<max0<<endl;
        }
        else
        {
            cout<<"最大子数组和为"<<max1<<endl;
        }
    }
    
    delete[] array;
}