蓝桥杯采摘蓝莓

#include <bits/stdc++.h>
using namespace std;
int main()
{
  int n,x,s=0,a[1005],t=0,max=-1005,min=1005;
  scanf("%d",&n);
  for(int i=0;i<n;i++)
  {
    scanf("%d",&a[i]);
    if(a[i]>0)
    s+=a[i],t++;
    if(a[i]<=0&&a[i]>max)
    max=a[i];
    if(a[i]>0&&a[i]<min)
    min=a[i];
  }
  if(t%2==0)
  {
    printf("%d",s);
  }
  else
  {
    if(t==n)
    printf("%d",s-min);
    else
    {
      if(max+min>=0)
      printf("%d",s+max);
      else
      printf("%d",s-min);
    }
  }
  return 0;
}