Pagini recente » Cod sursa (job #2542183) | Cod sursa (job #1757338) | Cod sursa (job #1983697) | Cod sursa (job #987775) | Cod sursa (job #2778099)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long v[505], d[505][505];
long long n, i, j, l, k;
int main()
{
fin >> n;
for(int i = 1; i <= n+1; i++)
fin >> v[i];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
d[i][j] = (1LL << 62);
for(int i = 1; i <= n; i++)
d[i][i] = 0;
for(int l = 2; l <= n; l++)
{
for(int i = 1; i+l-1 <= n; i++)
{
j = i + l - 1;
for(int k = i; k < j; k++)
{
d[i][j] = min(d[i][j], d[i][k] + d[k+1][j] + v[i] * v[k+1] * v[j+1]);
}
}
}
fout << d[1][n] << "\n";
return 0;
}