Pagini recente » Cod sursa (job #1868522) | Cod sursa (job #2447933) | Cod sursa (job #692820) | Cod sursa (job #2154855) | Cod sursa (job #1566727)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
long long c[501][501],n,d[501],l,i,j,x,k;
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(i=0;i<=n;i++)
f>>d[i];
f.close();
for(l=1;l<=n-1;l++)
for(i=1;i<=n-l;i++)
{
j=i+l;
c[i][j]=LONG_LONG_MAX;
for(k=i;k<j;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];
g.close();
return 0;
}