C++编程之美-数字之魅(代码清单2-25)

代码清单2-25

int MaxSum(int* A, int n)
{
     int maximum = -INF;
     int sum;
     for(int i = 0; i < n; i++)
     {
          sum = 0;
          for(int j = i; j < n; j++)
          {
               sum += A[j];
               if(sum > maximum)
                    maximum = sum;
          }
     }
     return maximum;
}