Pagini recente » Monitorul de evaluare | Cod sursa (job #1348738) | Cod sursa (job #721296) | Cod sursa (job #1025403) | Cod sursa (job #1566728)
#include <iostream>
#include <fstream>
#include <climits>
#define maxi LLONG_MAX
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long c[501][501],n,x,d[501],k;
int main()
{
long long i,j,l;
f>>n;
for (i=0;i<=n;i++)
f>>d[i];
for (l=1;l<=n-1;l++)
for (i=1;i<=n-l;i++)
{
j=i+l;
c[i][j]=maxi;
for (k=i;k<=j-1;k++)
{
x=c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j];
if (x<c[i][j])
{
c[i][j]=x;
c[j][i]=k;
}
}
}
g<<c[1][n];
return 0;
}