Pagini recente » Istoria paginii runda/545365768778888853 | Cod sursa (job #1061791) | Cod sursa (job #750573) | Cod sursa (job #1878280) | Cod sursa (job #2006700)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <queue>
#include <stack>
#include <vector>
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int NMax = 5e2 + 5;
const ll inf = 1e18 + 5;
int N;
ll dim[NMax],dp[NMax][NMax];
int main() {
in>>N;
for (int i=1;i <= N+1;++i) {
in>>dim[i];
}
for (int d=1;d < N;++d) {
for (int i=1;i+d <= N;++i) {
dp[i][i+d] = inf;
for (int j=i;j < i+d;++j) {
ll val = dp[i][j] + dp[j+1][i+d] + dim[i] * dim[j+1] * dim[i+d+1];
dp[i][i+d] = min(dp[i][i+d],val);
}
}
}
out<<dp[1][N];
in.close();out.close();
return 0;
}