Pagini recente » Cod sursa (job #1548501) | Cod sursa (job #1061549) | Cod sursa (job #442395) | Cod sursa (job #1684571) | Cod sursa (job #495313)
Cod sursa(job #495313)
#include <fstream>
using namespace std;
int m[505][505],n,i,k,j,p[505],l;
int main()
{
ifstream fi("podm.in");
ofstream fo("podm.out");
fi>>n;
for(i=1;i<=n+1;i++) fi>>p[i], m[i][i]=0;
for(l=2;l<=n;l++)
for(i=1;i<=n-l+1;i++)
{
j=i+l-1;
m[i][j]=int(2e9);
for(k=i+1;k<=j;k++)
if(m[i][j]>m[i][k-1]+m[k][j]+p[i]*p[k]*p[j+1])
m[i][j]=m[i][k-1]+m[k][j]+p[i]*p[k]*p[j+1];
j=1;
}
fo<<m[1][n];
return 0;
}