软件工程——一维数组（溢出问题）

//作者：赵建松、张文冬
#include<iostream>
#include<ctime>
#define N 1000
#define M 100000
using namespace std;
int main()
{
	int count=0;
    srand((unsigned)time(NULL)); 
    long int * arr=new long int[N];
    long int result_h,result_l,k=0;//sum=0;
    long int high=0,low=0,count1=0,count2=0,c1=0,c2=0;

    // cout<<"随机产生"<<M<<"个数值:\n"<<endl;
    for ( long int i=0; i<N; i++ ) {
		//cin>>arr[i];
		arr[i]=214789635 ;
    }

	result_h=arr[0]/M;
	result_l=arr[0]%M;

	if(arr[0]<0) result_l*=(-1);

	for (int s=0;s<N;s++)
	{
		cout<<"第"<<(s+1)<<"个元素为:"<<arr[s]<<endl;
	}


    for ( int long j=0; j<N; j++ ) {
        if ( high>=0 ){ 
			c2=j;
			low=low+arr[j]%M;
			high=high+arr[j]/M+low/M;
			low=low%M;
			if(arr[j]<0) low*=(-1);
			count++;
		}
        else { 
			c1=j;
			low=arr[j]%M;
			if(arr[j]<0) low*=(-1);
			high=arr[j]/M;
			count=1;
		}
		if( result_h<high||(result_h==high && (result_l>0 && result_l<low)||(result_l<0 && result_l>low)))
		{
			count1=c1;
			count2=c2;
            result_h=high;
			result_l=low;
        }
    }
	cout<<endl<<"从第"<<(count1+1)<<"到第"<<(count2+1)<<"个元素为最大子数组"<<endl<<endl;
	if(result_l==0){
		cout<<"最大数组之和:"<<result_h<<result_l<<"0000"<<endl<<endl;

	}
	else
		cout<<"最大数组之和:"<<result_h<<result_l<<endl<<endl;
		
    return 0;
}