Pagini recente » Cod sursa (job #138760) | Cod sursa (job #1819968) | Cod sursa (job #624009) | Cod sursa (job #2174696) | Cod sursa (job #705196)
Cod sursa(job #705196)
#include<iostream>
#include<fstream>
using namespace std;
#define MAXN 503
#define INF 100000
int main () {
ifstream in("podm.in");
ofstream out("podm.out");
int n, i;
int p[MAXN];
int m[MAXN][MAXN];
int s[MAXN][MAXN];
int l, k, q, j;
int inf = 30000;
in >> n;
for (i = 0; i <= n; i++)
in >> p[i];
for (i = 1; i <= n; i++)
m[i][i] = 0;
for(l = 2; l <= n; l++)
for(i = 1; i <= (n-l+1); i++) {
j = i + l - 1;
m[i][j] = INF;
for (k = i; k <= j - 1; k++) {
q = m[i][k] + m[k + 1][j] + p[i - 1]*p[k]*p[j];
if (q < m[i][j]) {
m[i][j] = q;
s[i][j] = k;
}
}
}
out << q;
in.close();
out.close();
}