Pagini recente » Cod sursa (job #2131158) | Cod sursa (job #660609) | Cod sursa (job #1040460) | Cod sursa (job #2884410) | Cod sursa (job #1090854)
#include <stdio.h>
#include <algorithm>
#define max1 1LL<<60
using namespace std;
FILE *f=fopen("podm.in","r");
FILE *g=fopen("podm.out","w");
long long d[1005],m[501][501];
int i,k,n,dd;
int main()
{
fscanf(f,"%d",&n);
for(i=0;i<=n;i++)
fscanf(f,"%d",&d[i]);
for(i=1;i<=n;i++)m[i][i]=0;
for(i=1;i<=n-1;i++)m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(dd=2;dd<n;dd++)
for(i=1;i<=n-dd;i++)
{
m[i][i+dd]=max1;
for(k=i;k<=i+dd;k++)
m[i][i+dd]=min(m[i][i+dd],m[i][k]+m[k+1][i+dd]+d[i-1]*d[k]*d[i+dd]);
}
fprintf(g,"%d",m[1][n]);
fclose(g);
return 0;
}