Pagini recente » Cod sursa (job #2605831) | Cod sursa (job #1267665) | Cod sursa (job #1832916) | Cod sursa (job #876297) | Cod sursa (job #650415)
Cod sursa(job #650415)
#include<stdlib.h>
#include<stdio.h>
//#include<conio.h>
long long min(long long a,long long b)
{
if(a<b) return a;
return b;
}
int main()
{
FILE *f,*g;
f=fopen("podm.in","r");
g=fopen("podm.out","w");
int dim[506],n,i,j,d,k;
long long M[505][505],infinit=100000000000000000LL;
fscanf(f,"%d",&n);
for(i=0;i<=n;i++)
fscanf(f,"%d",&dim[i]);
for(i=1;i<=n;i++)
{
M[i][i]=0;
if(i<n)
M[i][i+1]=dim[i-1]*dim[i]*dim[i+1];
}
for(i=1;i<n-1;i++)
for(j=i+2;j<=n;j++)
M[i][j]=infinit;
for(d=1;d<n;d++)
for(i=1;i<=n-d;i++)
for(k=i;k<i+d;k++)
M[i][i+d]=min(M[i][i+d],M[i][k]+M[k+1][i+d]+dim[i-1]*dim[k]*dim[i+d]);
fprintf(g,"%lld",M[1][n]);
fclose(f);
fclose(g);
return 0;
}