Pagini recente » Cod sursa (job #717346) | Cod sursa (job #2128497) | Cod sursa (job #1091225) | Cod sursa (job #1536328) | Cod sursa (job #2607622)
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
typedef long long ll;
typedef long long unsigned llu;
typedef vector<int> vi;
typedef pair<int, int> pi;
#ifdef _DEBUG
ifstream fin("..\\date.in");
#endif
#define NMAX 501
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int m[NMAX][NMAX], d[NMAX], minim;
int main() {
int n, indice;
ios::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
fin >> n;
rep(i, 0, n) fin >> d[i];
rep(i, 1, n - 1)m[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
rep(j, 2, n) {
rep(i, 1, n - j) {
minim = 100000000000000000;
rep(k, i, i + j - 1) {
if (m[i][k] + m[k + 1][j + i] + d[i - 1] * d[k] * d[j + i] < minim) {
minim = m[i][k] + m[k + 1][j + i] + d[i - 1] * d[k] * d[j + i];
indice = k;
}
}
m[i][j + i] = minim;
m[j + i][i] = indice;
}
}
fout << m[1][n];
return 0;
}