计蒜客 A2232 程序设计：蒜厂年会

 

 代码如下：

#include<stdio.h>
main()
{
  int n,i;
  scanf("%d",&n);
  long long data[n],accum=0;
  for(i=0;i<n;i++)
  {
      scanf("%lld",&data[i]);
      accum+=data[i];
  }
  long long max=0,max_accum=0,min=0,min_accum=0;
  for(i=0;i<n;i++)
  {
    min_accum+=data[i];
    max_accum+=data[i];
    if(max_accum>max)max=max_accum;
    if(min_accum<min)min=min_accum;
    if(max_accum<0)max_accum=0;
    if(min_accum>0)min_accum=0;
  }
  if(max>accum-min)
  printf("%lld",max);
  else
  printf("%lld",accum-min);
  return 0;
}