Pagini recente » Cod sursa (job #1575366) | Cod sursa (job #2814531) | Cod sursa (job #1514591) | Cod sursa (job #695948) | Cod sursa (job #1106566)
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n,i,j,k,l,d[505][505],a[505],y,minim;
int main()
{
f>>n;
for(i=1;i<=n+1;i++)
f>>a[i];
for(l=1;l<n;l++){
for(i=1;i+l<=n;i++){
j=i+l;
minim=1000000000000;
for(k=i;k<j;k++){
y=d[i][k]+d[k+i][j]+a[i]*a[k+1]*a[j+1];
if(y<minim)
minim=y;
}
d[i][j]=minim;
}
}
g<<d[1][n];
return 0;
}