石子合并

#include <stdio.h>   
#include <stdlib.h>   
int n,f[101][101],sum[101][101],a[101];
int main()
{
	int i,j,k,t;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(i=1;i<=n;i++){
		f[i][i]=0;
		sum[i][i]=a[i];
		for(j=i+1;j<=n;j++)
			sum[i][j]=sum[i][j-1]+a[j];
	}
	for(int len=2;len<=n;len++){	
		for(i=1;i<=n-len+1;i++){		
			j=i+len-1;
			f[i][j]=1000000000;
			for(k=i;k<=j-1;k++){
				if(f[i][j]>f[i][k]+f[k+1][j]+sum[i][j])
					f[i][j]=f[i][k]+f[k+1][j]+sum[i][j];
			}
		}
	}
	printf("%d/n",f[1][n]);  
	return 0;
}