Pagini recente » Cod sursa (job #404713) | Monitorul de evaluare | Cod sursa (job #829610) | Cod sursa (job #1054701) | Cod sursa (job #3333415)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int n, pd[502][502] = {0}, vect[503], s = 1000000000001,i, j,x,k;
int main()
{
fin>>n;
for(i=1; i<=n+1; i++){
fin>>vect[i];
}
for(x=1; x<n; x++){
for(i =1; i<=n; i++ ){
j=i+x;
if(j <= n){
s = 1000000000001;
for(k = i; k<j; k++){
s = min((pd[i][k] + pd[k+1][j] + vect[i]*vect[k+1]*vect[j+1]), s);
}
pd[i][j] = s;
}
}
}
fout<<pd[1][n];
}