Pagini recente » Cod sursa (job #2155041) | Cod sursa (job #379792) | Cod sursa (job #852583) | Cod sursa (job #765575) | Cod sursa (job #2096431)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
#define mp make_pair
const int NMax = 5e2 + 5;
const ll inf = 1e18 + 5;
using zint = short;
int N;
ll v[NMax],dp[NMax][NMax];
int main() {
in>>N;
for (int i=1;i <= N+1;++i) {
in>>v[i];
}
for (int d=2;d <= N;++d) {
int j;
for (int i=1;(j = i + d - 1) <= N;++i) {
dp[i][j] = inf;
for (int k=i;k < j;++k) {
ll val = dp[i][k] + dp[k+1][j] + v[i] * v[k+1] * v[j+1];
dp[i][j] = min(dp[i][j],val);
}
}
}
out<<dp[1][N];
in.close();out.close();
return 0;
}