Pagini recente » Rating Iosif Ardelean (someone) | Cod sursa (job #1864919) | Cod sursa (job #650083) | Cod sursa (job #1832598) | Cod sursa (job #2245852)
#include <climits>
#include <fstream>
#define NMAX 510
std::ifstream fin("podm.in");
std::ofstream fout("podm.out");
int n;
long long int v[NMAX];
long long int dp[NMAX][NMAX];
inline int min(int x, int y) {
return x < y ? x : y;
}
int main() {
fin >> n;
for (int i = 0; i <= n; i++)
fin >> v[i];
for (int len = 2; len <= n; len++)
for (int i = 1, j = 1 + len - 1; j <= n; i++, j++) {
dp[i][j] = INT_MAX;
for (int k = i; k < j; k++)
dp[i][j] = min(
dp[i][j],
dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j]
);
}
fout << dp[1][n] << '\n';
fout.close();
return 0;
}