Pagini recente » Cod sursa (job #1653077) | Cod sursa (job #2989413) | Cod sursa (job #868649) | Cod sursa (job #402266) | Cod sursa (job #2094814)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int main()
{
int a[100][100],d,i,l[100],c[100],n,b[100];
f>>n;
for(i=1;i<=n+1;i++)
{
f>>b[i];
}
for(i=1;i<=n;i++)
{
l[i]=b[i];
c[i]=b[i+1];
}
for(i=1;i<=n;i++)
{
a[i][i+1]=l[i]*c[i]*c[i+1];
}
for(d=2;d<n;d++)
for(i=1;i<=n-d;i++)
a[i][i+d]=min(a[i][i+d-1]+l[i]*l[i+d]*c[i+d],a[i+1][i+d]+l[i]*c[i]*c[i+d]);
g<<a[1][n];
return 0;
}