Pagini recente » Cod sursa (job #2821565) | Cod sursa (job #1903366) | Cod sursa (job #2196617) | Cod sursa (job #2152339) | Cod sursa (job #1020101)
#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];
}
long long Min(long long a, long long b)
{
if (a < b)
return a;
return b;
}
void Matrice()
{
int j;
for (int i = 1; i <= n; ++i)
b[i][i] = 0;
for (int i = 1; i < n; i++)
b[i][i + 1] = a[i - 1] * a[i] * a[i + 1];
for (int tz = 2; tz < n; tz++)
{
for (int i = 1; i <= n - tz; i++)
{
j = i + tz;
b[i][j] = 0x3f3f3f3f;
for (int 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;
}