Pagini recente » Cod sursa (job #238627) | Cod sursa (job #1869407) | Cod sursa (job #2325904) | Cod sursa (job #2135572) | Cod sursa (job #661213)
Cod sursa(job #661213)
#include <cstdio>
#include <algorithm>
#define NMAX 501
using namespace std;
long long m[NMAX][NMAX], p[NMAX];
int N, INF = 1LL<<60;
int main()
{
int i, j, k;
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
scanf("%d", &N);
for(i=0;i<=N;++i)
{
scanf("%d", &p[i]);
}
for(i=N;i>=1;--i)
{
for(j=i+1;j<=N;++j)
{
m[i][j] = INF;
for(k=i;k<j;++k)
{
if(m[i][j] > m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
{
m[i][j] = m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j];
}
}
}
}
printf("%d", m[1][N]);
return 0;
}