Pagini recente » Cod sursa (job #1227225) | Cod sursa (job #610889) | Clasamentul arhivei de probleme | Cod sursa (job #3294177) | Cod sursa (job #588392)
Cod sursa(job #588392)
#include<fstream.h>
long long a[501][501],m;
int dim[501],i,n,j,d,k;
int main()
{ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(i=0;i<=n;i++)
f>>dim[i];
for(i=1;i<=n;i++)
a[i][i]=0;
for(d=1;d<n;d++)
for(i=1;i<=n-d;i++)
{a[i][i+d]=1LL;
for(k=i;k<i+d;k++)
if(a[i][i+d]>(m=a[i][k]+a[k+1][i+d]+dim[i]*dim[k+1]*dim[i+d+1]))
a[i][i+d]=m,a[i+d][i]=k;}
g<<a[1][n];
f.close();
g.close();
return 0;}