Pagini recente » Cod sursa (job #1503184) | Cod sursa (job #1732498) | Cod sursa (job #2441878) | Cod sursa (job #859415) | Cod sursa (job #707824)
Cod sursa(job #707824)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int min(int a, int b)
{
if (a < b)
return a;
return b;
}
int main()
{
int a[510][510], nr;
in >> nr;
for (int i = 1; i <= nr + 1; i++)
in >> a[i][i];
for (int i = 1; i <= nr; i++)
a[i][i + 1] = 0;
for (int k = 2; k <= nr ; k++)
for (int i = 1; i <= nr - k + 1; i++)
{
int j = i + k;
a[i][j] = min(a[i][j - 1] + a[i][i] * a[j - 1][j - 1] * a[j][j],
a[i + 1][j] + a[i + 1][i + 1] * a[j][j] * a[i][i]);
}
out << a[1][nr + 1] << endl;
}