Pagini recente » Cod sursa (job #1646404) | Cod sursa (job #2050128) | Cod sursa (job #2390153) | Cod sursa (job #3137692) | Cod sursa (job #2023907)
#include <iostream>
#include <cstdio>
#define NMAX 505
#define MAX 0x3f3f3f
using namespace std;
long long v[NMAX], n, dp[NMAX][NMAX], pozMin;
void read()
{
scanf("%dll", &n);
for(int i=0; i<=n; ++i)
scanf("%dll", &v[i]);
for(int i=1; i<=n; ++i)
for(int j=i+1; j<=n; ++j)
dp[i][j] = MAX;
}
void solve()
{
for(int nr=2; nr<=n; ++nr)
for(int i=1, j=nr; j<=n; ++j, ++i)
{
for(int k=i; k<=j-1; ++k)
{
if(dp[i][j] > dp[i][k] + dp[k+1][j] + v[i-1]*v[k]*v[j])
{
dp[i][j] = dp[i][k] + dp[k+1][j] + v[i-1]*v[k]*v[j];
pozMin = k;
}
}
dp[j][i] = pozMin;
}
printf("%d\n\n", dp[1][n]);
}
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
read();
solve();
return 0;
}