Pagini recente » Cod sursa (job #1908862) | Cod sursa (job #1256902) | Cod sursa (job #1236578) | Cod sursa (job #2329263) | Cod sursa (job #1020109)
#include <fstream>
#include <climits>
using namespace std;
int n;
long long a[505], b[505][505];
void Citire()
{
ifstream fin("podm.in");
fin >> n;
for (int i = 0; i <= n; ++i)
fin >> a[i];
for (int i = 0; i <= 504; ++i)
for (int j = 0; j <= 504; ++j)
b[i][j] = 0x3f3f3f3f;
}
long long Min(long long a, long long b)
{
if (a < b)
return a;
return b;
}
void Matrice()
{
int i, j, k, tz;
for (i = 1; i <= n; ++i)
b[i][i] = 0;
for (i = 1; i < n; ++i)
b[i][i + 1] = a[i - 1] * a[i] * a[i + 1];
for (tz = 2; tz <= n; ++tz)
{
for (i = 1, j = tz; j <= n; ++i, ++j)
{
for (k = i; k <= j; ++k)
b[i][j] = Min(b[i][j], b[i][k] + b[k + 1][j] + a[i - 1] * a[k] * a[j]);
}
}
}
void Afisare()
{
ofstream fout("podm.out");
fout << b[1][n];
}
int main()
{
Citire();
Matrice();
Afisare();
return 0;
}