1892914_tle.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

int  v[2001], n;

long max(long a, long b)
{
 return a>b?a:b;
}
long f(int x, int y, int m)
{ 
 if(x == y) return m*v[x];
 return max(m*v[x]+f(x+1,y,m+1),m*v[y]+f(x,y-1,m+1));
}
int main()
{
  int i, j;

  scanf("%d",&n);
  for(i = 0; i < n; i++)
   scanf("%d",&v[i]);
  i = 0; j = n - 1;
 printf("%ld\n",f(i,j,1));
 return 1;
}