Pagini recente » Cod sursa (job #1883360) | Cod sursa (job #1273347) | Cod sursa (job #2959459) | Cod sursa (job #2861384) | Cod sursa (job #2281433)
#include <iostream>
#include <fstream>
using namespace std;
long long int m[505][505];
void afisare(int n)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
cout<<m[i][j]<<' ';
cout<<endl;
}
cout<<endl;
}
int main()
{
ifstream fin ("podm.in");
ofstream fout ("podm.out");
int n,d[505];
fin>>n;
//n++;
for (int i=0; i<n+1; i++)
fin>>d[i];
for (int i=1; i<=n-1; i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
//afisare(n);
for (int diag=2; diag<=n-1; diag++)
for (int i=1; i<=n-diag; i++)
{
int j=i+diag;
m[i][j]=9223372036854775807;
for (int k=i; k<=j-1; k++)
m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j]);
}
fout<<m[1][n];
//afisare(n);
return 0;
}