Pagini recente » Cod sursa (job #952713) | Cod sursa (job #770471) | Cod sursa (job #672195) | Cod sursa (job #2904701) | Cod sursa (job #2795363)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
int n;
int dim[501],dp[501][501];
int main()
{
f >> n;
for(int i = 1; i<=n+1; i++)
f >> dim[i];
int dif = 1,i,j;
while(dif<=n-1)
{
i = 1;
j = i+dif;
while(j<=n)
{
for(int k = i; k<=j-1; k++)
{
if(dp[i][j]==0)
{
dp[i][j] = dp[i][k] + dp[k+1][j] + (dim[k+1]*dim[i]*dim[j+1]);
}
else
{
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j] + (dim[k+1]*dim[i]*dim[j+1]));
}
}
i++;
j++;
}
dif++;
}
g<<dp[1][n];
}