石子合并

怒贴代码：

             

#include<cstdio>
#define INF 199999999
int  n , m, i, j, l, k, an1 = INF, an2 = -INF, Min[ 2002][ 2002], Max[ 2002][ 2002], w[ 2002][ 2002], h[ 2002];
inline void MAX(int &num1,int num2, int num3){ if (num2>num3) num1=num2; else num1=num3; num1+=h[j]-h[i-1];}
inline void MIN(int &num1,int num2){ if (num2<num1) num1=num2, w[ i][ j]=k;}
int main ( )
{
    scanf( "%d", &n);   m = 2 * n - 1 ;
    for ( i = 1; i <= n; i++) scanf( "%d", &h[ i]), h[ i+n] = h[ i];
    for ( i = 1; i <= m; i++) h[ i] += h[ i-1], w[ i][ i] = i;
    for ( l = 1; l <  n  ; l++)
    for ( i = 1; i <= m-l; i++)
    {
        j = i + l, Min[ i][ j] = INF;
        for ( k = w[ i][ j-1]; k <= w[ i+1][ j]; k++)
        MIN( Min[ i][ j], Min[ i][ k]+ Min[ k+1][ j]); Min[ i][ j] += h[ j]-h[ i-1];
        MAX( Max[ i][ j], Max[ i][ i]+ Max[ i+1][ j] , Max[ i][ j-1] + Max[ j][ j]);
    }    for ( i = 1; i <= m-n+1; i++)  if  ( Max[ i][ i+n-1] > an2) an2 = Max[ i][ i+n-1];
    for ( i = 1; i <= m-n+1; i++) MIN( an1, Min[ i][ i+n-1]); printf( "%d
%d", an1, an2);
}