Pagini recente » Cod sursa (job #2710925) | Cod sursa (job #977958) | Cod sursa (job #1688244) | Cod sursa (job #442137) | Cod sursa (job #3251570)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,a[501];
unsigned long long dp[501][501];
int main()
{
fin>>n;
for(int i=0;i<=n;++i){
fin>>a[i];///Mi are dimensiunea a[i-1]*a[i]
}
/*for(int i=2;i<=n+1;++i){
dp[i][i+1]=a[i-1]*a[i]*a[i+1];///Mi*Mi+1
}*/
for(int lungime=2;lungime<=n;++lungime){
for(int i=1;i<=n-lungime+1;++i){
unsigned long long val;
int dr = i + lungime -1;
dp[i][dr]=1e18;
for(int j=1;j<dr;++j){
val=dp[i][j]+dp[j+1][dr]+a[i-1]*a[j]*a[dr];
if(dp[i][dr]>val)
dp[i][dr]=val;
}
}
}
fout<<dp[1][n];
return 0;
}