Pagini recente » Cod sursa (job #2439509) | Cod sursa (job #837654) | Cod sursa (job #1898365) | Cod sursa (job #2229074) | Cod sursa (job #2392772)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const long long NMax = 500, oo = (1LL << 60);
long long N, DP[NMax + 5][NMax + 5], V[NMax + 5];
int main()
{
fin >> N;
for(int i = 1; i <= N + 1; i++)
fin >> V[i];
for(int l = 2; l <= N; l++)
for(int st = 1; st + l - 1 <= N; st++)
{
int dr = st + l - 1; DP[st][dr] = oo;
for(int k = st; k < dr; k++)
DP[st][dr] = min(DP[st][dr], DP[st][k] + DP[k + 1][dr] + V[st] * V[k + 1] * V[dr + 1]);
}
fout << DP[1][N] << '\n';
fin.close();
fout.close();
return 0;
}