Pagini recente » Cod sursa (job #1602967) | Cod sursa (job #214526) | Cod sursa (job #573233) | Cod sursa (job #1075780) | Cod sursa (job #2853650)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
long long n;
long long v[50001];
long long dp[511][511];
void citire()
{
f >> n;
for(long long i = 1;i<=n+1;i++)
{
f >> v[i];
}
}
void dp1()
{
long long dif = 1,i=1,j;
while(dif<=n-1)
{
i = 1;
while(i<=n-dif)
{
j = i+dif;
for(long long intermediar = i;intermediar<j;intermediar++)
{
if(dp[i][j] == 0)
{
dp[i][j] = dp[i][intermediar] + dp[intermediar+1][j] + (v[i]*v[intermediar+1]*v[j+1]);
}
else
{
dp[i][j] = min( dp[i][j],dp[i][intermediar] + dp[intermediar+1][j] + (v[i]*v[intermediar+1]*v[j+1]));
}
}
i++;
}
dif++;
}
}
int main()
{
citire();
dp1();
g << dp[1][n];
}