Pagini recente » Cod sursa (job #1366937) | Cod sursa (job #205180) | Cod sursa (job #2976396) | Cod sursa (job #784146) | Cod sursa (job #813015)
Cod sursa(job #813015)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int n, d[504], cmin[504][504];
long long int infinit=1000000000000000000LL;
void citire();
void afisare();
void pd();
int main()
{
citire();
pd();
afisare();
return 0;
}
void citire()
{
int i;
fin>>n;
for(i=0;i<=n;i++) fin>>d[i];
}
void pd()
{
int i, j, nr, k, kmin;
for(i=1;i<n;i++) cmin[i][i+1]=d[i-1]*d[i]*d[i+1];
for(nr=1;nr<=n-1;nr++)
for(i=1;i<=n-nr;i++)
{
kmin=-1; j=nr+i; cmin[i][j]=infinit;
for(k=i;k<j;k++)
if(cmin[i][k]+cmin[k+1][j]+d[i-1]*d[k]*d[j]<cmin[i][j])
{
cmin[i][j]=cmin[i][k]+cmin[k+1][j]+d[i-1]*d[k]*d[j];
kmin=k;
}
cmin[j][i]=kmin;
}
}
void afisare()
{
fout<<cmin[1][n]<<'\n';
fout.close();
}