最大子列和問題(20) - 中國大學MOOC-陳越、何欽銘-數據結構基礎習題集

#include <iostream>

long maxSubSum2(int A[] ,int N) 
{ 
  int thisSum , maxSum =0;
  int i,j;
  for (int i = 0; i < N; i++) 
  {
    int thisSum = 0; 
    for (int j = i; j < N; j++) 
    { 
      thisSum += A[j]; 
      if (thisSum > maxSum) 
        maxSum = thisSum; 
     } 
  } 
  return maxSum; 
}

int main(){
  int n=0;
  scanf("%d",&n);
  int *number=new int[n]; 
  for(int i=0;i<n;++i)
       scanf("%d ",&number[i]);
  int maxsum = 0;
  maxsum = maxSubSum2(number,n);
  printf("%d",maxsum);
}