Pagini recente » Cod sursa (job #3214194) | Cod sursa (job #2972559) | Borderou de evaluare (job #2011018) | Borderou de evaluare (job #1705087) | Cod sursa (job #3031974)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("podm.in");
ofstream fout("podm.out");
int P[501][501];
int S[501], N;
int main()
{
fin >> N;
for (int i=1; i<=N+1; i++)
fin >> S[i];
for (int i=1; i<N; i++)
{
P[i][i+1] = S[i]*S[i+1]*S[i+2];
}
for (int d=3; d<=N; d++)
{
for (int i=1, j=d; j<=N; i++,j++)
{
int m = 999999999;
for (int k=i; k<j; k++)
{
m = min(m, P[i][k] + P[k+1][j] + S[i] * S[k+1] * S[j+1]);
}
P[i][j] = m;
}
}
fout << P[1][N];
return 0;
}