Pagini recente » Cod sursa (job #1092486) | Cod sursa (job #2905985) | Cod sursa (job #1525257) | Cod sursa (job #843401) | Cod sursa (job #1563738)
#include <bits/stdc++.h>
#define oo 100000000000000LL
using namespace std;
long long t[505], a[505][505];
int n;
void Citire()
{
int i;
ifstream fin("podm.in");
fin >> n;
for (i = 0; i <= n; ++i)
fin >> t[i];
fin.close();
}
void Rezolva()
{
int i, j, pas, k;
long long x;
for (i = 1; i < n; ++i)
a[i][i + 1] = t[i - 1] * t[i] * t[i + 1];
for (pas = 2; pas < n; ++pas)
for (i = 1; i <= n - pas; ++i)
{
j = i + pas;
x = oo;
for (k = i; k < j; ++k)
x = min(x, a[i][k] + a[k+1][j] + t[i - 1]*t[k]*t[j]);
a[i][j] = x;
}
}
void Afisare()
{
ofstream fout("podm.out");
fout << a[1][n] << "\n";
fout.close();
}
int main()
{
Citire();
Rezolva();
Afisare();
return 0;
}