Pagini recente » Cod sursa (job #604311) | Cod sursa (job #572095) | Cod sursa (job #3123092) | Cod sursa (job #2363831) | Cod sursa (job #1581329)
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#define MOD 2011
#define NMAX 505
#define HMAX 550
#define INF 0x3f3f3f3f
#define mp make_pair
using namespace std;
FILE *fin = freopen("podm.in", "r", stdin);
FILE *fout = freopen("podm.out", "w", stdout);
typedef pair<int, int> pii;
int a[NMAX];
int dp[NMAX][NMAX];
int calc(int l, int r) {
if (l == r)
return dp[l][r] = 0;
if (l + 1 == r)
return dp[l][r] = a[l - 1] * a[l] * a[l + 1];
int i, minv = INF;
for (i = l; i < r; ++i)
minv = min(minv, calc(l, i) + calc(i + 1, r) + a[l - 1] * a[i] * a[r]);
return dp[l][r] = minv;
}
int main() {
int n, i, j, t,k;
cin >> n;
for (i = 0; i <= n; ++i)
cin >> a[i];
calc(1, n);
cout << dp[1][n];
return 0;
}