Pagini recente » Cod sursa (job #198406) | Cod sursa (job #544860) | Cod sursa (job #420519) | Cod sursa (job #2603214) | Cod sursa (job #2497907)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int a[510],n;
long long dp[510][510];
int main()
{
in>>n;
for(int i=1;i<=n+1;i++)
in>>a[i];
for(int i=n;i>=1;i--){
for(int j=1;j<=n;j++){
long long mini=dp[i][j]+dp[i+1][j]+a[i]*a[i+1]*a[j+1];
for(int k=i;k<j;k++)
if(mini>dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1])
mini=dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1];
if(i!=j)
dp[i][j]=mini;
else
dp[i][j]=0;
}
}
out<<dp[1][n];
return 0;
}