最大子数组之和（N）

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

     int i = ;
     for(i = ; i < n; i++)
     {
         if(newsum >= )
             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 = ;
     int i = , j = , k =;

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

             if(sum > maxinum)
                 maxinum = sum;

             sum = ;
         }
     }

     return maxinum;
 }