合并石子

最新推荐文章于 2024-08-30 09:30:00 发布

u010583225

最新推荐文章于 2024-08-30 09:30:00 发布

阅读量635

点赞数

本文链接：https://blog.csdn.net/u010583225/article/details/86752304

版权

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int n,f[300][300];
int s[300];

int main()
{
   int x,i;
   scanf("%d",&n);
   for( i=1;i<=n;i++){
   scanf("%d",&x);
   s[i]=s[i-1]+x;
   }
   memset(f,127/3,sizeof(f));
   for(i=1;i<=n;i++) f[i][i]=0;
   for(int len=2;len<=n;len++)
   for( i=1;i<=n-len+1;i++)
   {
   int j=i+len-1;
   for (int k=i;k<=j-1;k++)
if(f[i][j]>f[i][k]+f[k+1][j]+s[j]-s[i-1])
f[i][j]=f[i][k]+f[k+1][j]+s[j]-s[i-1];
   }
   printf("%d\n",f[1][n]);
   return 0;
}

//四边形优化

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int n,f[300][300];
int s[300];
int p[300][300];
int main()
{
   int x,i;
   scanf("%d",&n);
   for( i=1;i<=n;i++){
   scanf("%d",&x);
   s[i]=s[i-1]+x;
   }
   memset(f,127/3,sizeof(f));
   for(i=1;i<=n;i++) f[i][i]=0,p[i][i]=i;

   for(int len=2;len<=n;len++)
   for( i=1;i<=n-len+1;i++)
   {
   int j=i+len-1;
   for (int k=p[i][j-1];k<=p[i+1][j];k++)
if (f[i][j]>f[i][k]+f[k+1][j]+s[j]-s[i-1])
f[i][j]=f[i][k]+f[k+1][j]+s[j]-s[i-1],p[i][j]=k;
   }
   printf("%d\n",f[1][n]);
   return 0;
}