最大子数组之和（N）

int maxSum(int *array, int n)
{
    int rvsum = array[0];
    int newsum = 0;

    int i = 0;
    for(i = 0; i < n; i++) 
    {
        if(newsum >= 0)
            newsum += array[i];
        else    
            newsum = array[i];

        if(rvsum < newsum) 
            rvsum = newsum; 
    }

    return rvsum;
}   

 

//N^3
int MaxSum(int *array, int n)
{
    int maxinum = -INF; 
    int sum = 0;
    int i = 0, j = 0, k =0;

    for(i = 0; i < n; i++) 
    {
        for(j = i; j < n; j++) 
        {       
            for(k = i; k<= j; k++) 
            {       
                sum += array[k];
            }       

            if(sum > maxinum)
                maxinum = sum;

            sum = 0;
        }       
    }

    return maxinum;                                                                                                
}