Pagini recente » Cod sursa (job #748081) | Cod sursa (job #1034284) | Cod sursa (job #1294438) | Istoria paginii template/preoni-2008/runda-finala/probleme | Cod sursa (job #2008989)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int nmax=502;
int a[nmax],dp[nmax][nmax],n;
inline void Read()
{
fin>>n;
for(int i=0;i<=n;i++)
fin>>a[i];
}
inline void DP()
{
for(int i=1;i<n;i++)
dp[i][i+1]=a[i-1]*a[i]*a[i+1];
for(int pas=2;pas<n;pas++)
{
for(int i=1;i<=n-pas;i++)
{
int j=i+pas;
int x=1000000000;
for(int k=i;k<=j-1;k++)
x=min(x,dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);
dp[i][j]=x;
}
}
fout<<dp[1][n]<<"\n";
}
int main()
{
Read();
DP();
fin.close();
fout.close();
return 0;
}