二维数组最大子数组的和 结对开发 溢出问题

#include <iostream.h>

long int MaxSum2(long int *A, int n)
{
    long int nStart = A[n-1];
    long float nAll = A[n-1];    
    for(int i = n-2;i>=0;--i)
    {
        if(nStart<0)
            nStart = 0;
        nStart += A[i];
        if(nStart>=nAll)
        {
            nAll = nStart; 
			if(nAll>=1073741824)
				cout<<"溢出!"<<"\t";
        }
    }	
    return nAll;
}

int main(void)
{
	long int qian[100020];
	for(int i=0;i<100020;i++)
	{
		qian[i]=i;
		cout<<qian[i]<<"\t ";
	}

	cout<<MaxSum2(qian,100020)<<endl;
	return 0;
}