Pagini recente » Cod sursa (job #373157) | Cod sursa (job #264739) | Cod sursa (job #3149122) | Cod sursa (job #1687280) | Cod sursa (job #1315950)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int i,j,l,k,a[501],n;
long long d[501][501],x;
int main()
{
fin>>n;
for(i=0;i<=n;i++)
{
fin>>a[i];
}
for(l=2;l<=n;l++)
{
for(j=1;j<=n-l+1;j++)
{
d[j][j+l-1]=1ll<<62;
for(k=j;k<=j+l-1;k++)
{
x=d[j][k]+d[k+1][j+l-1]+a[j-1]*a[k]*a[j+l-1]*1ll;
if(d[j][j+l-1]>x)
d[j][j+l-1]=x;
}
}
}
fout<<d[1][n];
return 0;
}