Pagini recente » Cod sursa (job #2436409) | Cod sursa (job #235656) | Cod sursa (job #1622891) | Cod sursa (job #1773494) | Cod sursa (job #2345614)
#include<fstream>
using namespace std;
ifstream fi("podm.in");
ofstream fo("podm.out");
long long n,l,L[505],C[505],i,j,k,Dp[505][505];
int main()
{
fi>>n;
fi>>l;
for(i=1; i<=n; i++)
{
fi>>C[i];
L[i]=l;
l=C[i];
}
for(i=n-1; i>=1; i--)
for(j=i+1; j<=n; j++)
{
Dp[i][j]=1000000000000000000LL;
for(k=i; k<j; k++)
Dp[i][j]=min(Dp[i][j],Dp[i][k]+Dp[k+1][j]+L[i]*C[k]*C[j]);
}
fo<<Dp[1][n]<<"\n";
fi.close();
fo.close();
return 0;
}