第28页 2.12 a.求最小子序列和

int MinSubsequenceSum(int A[], int N)
{
  int ThisSum, MinSum, i;

  ThisSum = MinSum = A[0];

  for (i = 1; i < N; i++) {
    if (ThisSum > 0)
      ThisSum = A[i];
    else
      ThisSum += A[i];

    if (ThisSum <= MinSum)
      MinSum = ThisSum;
  }

  return MinSum;
}