1833754_ce.c

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

# include <stdio.h>


double n, a[200001];

double min(double i,double j)
{
 double li,s;
 s = a[i];
 if(i == j) return s;
 for(li = i + 1; li <= j; li++)
  if(a[li] < s)
  s = a[li];
  return s;
}

double sum(double i,double j)
{
  double s; double li;
  s = a[i];
  for(li = i + 1; li <= j; li++)
  s += a[li];
  return s;
}

double f(double i,double j)
{
  return (sum(i,j) * min(i,j));
}





main()
{
  
  double tmp, tmp1, max, s, t, max1, ma, mb, mm, nn;
  double li, lj;

  max = mm = nn = -1;
  scanf("%lf",&n);
  for(li = 0; li < n; li++)
   scanf("%lf",&a[li]);

  for(li = 0; li <n; li++)
    {
     tmp = max1 = a[li] * a[li]; 
      
     for(lj = li + 1; lj < n; lj++)
     {
	 s = min(li,lj-1);
	 t = sum(li,lj);
     if(a[lj] >= s) {tmp = f(li,lj);if(tmp >= max1) max1 = tmp; ma = li; mb = lj; continue;}
     if(t * a[lj] >= (t - a[lj]) * s ) {tmp = f(li,lj);if(tmp >= max1) ma = li; mb = lj;max1 = tmp;}
     }
	
    if( max1 >= max)
    {max = max1;mm = ma;nn = mb;}
    }
     
     printf("%.0lf\n%.0lf %.0lf\n",max,mm+1,nn+1);


 return 0;

}