Pagini recente » Cod sursa (job #1239806) | Cod sursa (job #379680) | Cod sursa (job #366184) | Cod sursa (job #2713150) | Cod sursa (job #2476291)
#include <iostream>
#include <fstream>
#define INF 1000000
using namespace std;
long long n,L[502],C[502];
long long dp[501][501];
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
f>>L[1];
for(int i=1;i<=n+1;i++)
{
f>>C[i];
L[i+1]=C[i];
}
for(int i=n-1;i>=1;i--)
for(int j=i+1;j<=n;j++)
{
dp[i][j]=dp[i][i]+dp[i+1][j]+L[i]*C[i]*C[j];
for(int k=i+1;k<j;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+L[i]*C[k]*C[j]);
}
g<<dp[1][n];
return 0;
}