浙大PAT最大子列和：Maximum Subsequence Sum

#include <iostream>

int MaxSubSeqSum(int A[], int n, int &first, int &last)
{
  int ThisSum(0),MaxSum(A[0]);
  int i(0),first_1(0);
  for(;i<n;i++)
  {
    ThisSum+=A[i];
    if(ThisSum>MaxSum)
    {
      MaxSum = ThisSum;
      last = i;
      first = first_1;
    }
    else if(ThisSum<0)
    {
      ThisSum = 0;
      first_1 = i+1;
    }
  }
  
  return MaxSum;
}

int main()
{
  int n,first(0),last(0);
  std::cin >> n;
  int K[n]{0};
  for(int i=0;i<n;i++)
  {
    std::cin >> K[i];
  }
  int Sum = MaxSubSeqSum(K,n,first,last);
  if(Sum<0)
    std::cout << 0 <<" " << K[0] << " " << K[n-1] << std::endl;
  else
    std::cout << Sum <<" " << K[first] << " " << K[last] << std::endl;
  return 0;
}