首尾相连的循环数组求其子数组最大值

#include<iostream>
#include<conio.h>
#include<ctime>
#define Max_Length 10
using namespace std;
int main()
{ 
    srand((unsigned)time(NULL)); 
    int * arr=new int[2*Max_Length];
    int result=0,r,sum,k=0,l=0,g=0,a,b=0,flag=0;
    int randoms,count1=0,count2=0,c1=0,c2=0;
    
    while(1)
    {
        cout<<"随机产生"<<Max_Length<<"个数值:\n"<<endl;
        for ( int i=0; i<Max_Length; i++ ) {
            randoms = ( -rand()%100 + ( rand()%100 ));
            arr[i] = arr[i+Max_Length] = randoms;
            cout<<"数组元素"<<i+1<<"分别为:"<<arr[i]<<endl;
        }

        for(int s=0; s<Max_Length; s++) {
            
            if(arr[s]<0 && g==s) {
                g++;
                if(a<arr[s])
                {
                    a=arr[s];
                }
                if(g==Max_Length)
                {
                    cout<<"最大数组之和:"<<a<<endl<<endl;
                }
            }
            if(arr[s]>0 && l==s) {
                l++;
                b+=arr[s];
                if(l==Max_Length)
                {
                    cout<<"最大数组之和:"<<b<<endl<<endl;
                }
            }

            if(arr[s]<0 && arr[s+1]>=0) {
                flag=1;
                r=arr[s+1];
                sum=0;
                for ( int t=0,j=s+1; j<s+Max_Length+1; j++ ) {
                    t++;
                    if ( sum>=0 )
                    { sum+=arr[j]; }
                    else 
                    { c1=j; sum=arr[j]; }
                    if( r < sum ) {
                        count1=c1;
                        count2=c2;
                        r=sum;    
                    }
                }
                if(result<r)
                {
                    result=r;

                }
                
            }
        }
        if(flag==1)
            cout<<"最大数组之和3:"<<result<<endl<<endl;
        result=a=b=arr[0];
        getch();
    }
    return 0;
}