Pagini recente » Cod sursa (job #985460) | Cod sursa (job #1389187) | Cod sursa (job #168837) | Cod sursa (job #2630729) | Cod sursa (job #1644608)
#include<fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
#define INF 100000000000000000LL
typedef long long i64;
i64 n, p[501],m[501][501];
i64 min(i64 a, i64 b) {
if (a < b) return a;
else return b;
}
void paranteze() {
for (int l = 2; l <= n; l++) {
for (int i = 1; i < n-l+2; i++) {
int j = i + l - 1;
m[i][j] = INF;
for (int k = i; k < j; k++) {
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i-1] * p[k] * p[j]);
}
}
}
fout << m[1][n];
}
int main() {
fin >> n;
for (int i = 0; i < n+1; i++)
fin >> p[i];
paranteze();
return 0;
}