Pagini recente » Cod sursa (job #1918343) | Cod sursa (job #920198) | Cod sursa (job #71583) | Cod sursa (job #1212412) | Cod sursa (job #1551099)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, x[505][505], r[505][505], d[10005];
void citire()
{
fin >> n;
for(int i = 1; i <= n; ++i)
fin >> d[i];
}
int main()
{
citire();
for(int s = 1; s < n; ++s)
{
for(int i = 1; i <= n - s; ++i)
{
x[i][i + s] = 100000000;
for(int k = i; k < i + s; k++)
{
int q = x[i][k] + x[k + 1][i + s] + d[i - 1] * d[k] * d[i + s];
if(q < x[i][i + s])
{
x[i][i + s] = q;
r[i][i + s] = k;
}
}
}
}
fout << x[2][n];
return 0;
}