Pagini recente » Cod sursa (job #2097249) | Cod sursa (job #1642040) | Cod sursa (job #1664564) | Cod sursa (job #1105887) | Cod sursa (job #2869744)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long d[505], a[505][505], minim, kmin;
int n;
int main()
{long long i, j, nr, k;
fin>>n;
for(i=0; i<=n; i++)
fin>>d[i];
for(nr=2; nr<=n; nr++)
{for(i=1; i<=n-nr+1; i++)
{j=i+nr-1;
minim=1000000000000;
for(k=i; k<j; k++)
{if(a[i][k]+a[k+1][j]+1LL*d[i-1]*d[k]*d[j]<minim)
{minim=a[i][k]+a[k+1][j]+1LL*d[i-1]*d[k]*d[j];
kmin=k;
}
}
a[i][j]=minim;
a[j][i]=kmin;
}
}
fout<<a[1][n];
return 0;
}