Pagini recente » Cod sursa (job #1685368) | Cod sursa (job #451915) | Cod sursa (job #132961) | Cod sursa (job #1561163) | Cod sursa (job #1007429)
#include <iostream>
#include <fstream>
using namespace std;
const int Nmax = 505;
const int oo = 0x3f3f3f3f;
int N;
int A[Nmax];
unsigned long long M[Nmax][Nmax];
void read()
{
freopen("podm.in", "r", stdin);
scanf("%d", &N);
for ( int i = 0; i <= N; ++i )
scanf("%d", &A[i]);
fclose( stdin );
}
void DP()
{
for ( int n = 2; n <= N; ++n )
for ( int i = 1; i <= N - n + 1; ++i )
{
int j = i + n - 1;
M[i][j] = oo;
for ( int k = i; k < j; ++k )
M[i][j] = min ( M[i][j], M[i][k] + M[k + 1][j] + 1LL * A[i - 1] * A[k] * A[j] );
}
}
void print()
{
freopen("podm.out", "w", stdout);
printf("%I64d\n", M[1][N]);
fclose( stdout );
}
int main()
{
read();
DP();
print();
return 0;
}