Pagini recente » Cod sursa (job #567018) | Cod sursa (job #1359815) | Cod sursa (job #920834) | Cod sursa (job #149360) | Cod sursa (job #2916294)
#include<bits/stdc++.h>
#define int long long
#define INF 1000000000000000
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int v[504],dp[504][504];
///dp[i][j]=numarul minim de inmultiri daca adunam matricile din intervalul
///i,j(Ai,Ai+1,Ai+2,...,Aj)
signed main()
{
int n,i,j,k,lg,dr;
f>>n;
for(i=1;i<=n+1;i++)
f>>v[i];
dp[1][1]=0;
for(lg=2;lg<=n;lg++)
{
for(i=1;i<=n-lg+1;i++)
{
j=i+lg-1;
dp[i][j]=INF;
for(k=i;k<j;k++)
{
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+v[i]*v[j+1]*v[k+1]);
}
}
}
g<<dp[1][n];
return 0;
}