Pagini recente » Cod sursa (job #1702726) | Cod sursa (job #3213386) | Cod sursa (job #1899392) | Cod sursa (job #1262003) | Cod sursa (job #2476282)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n,l[101],c[101],x[101][101];
int main()
{ in>>n;
in>>l[1];
for(int i=1;i<=n+1;i++)
{ in>>c[i];
l[i+1]=c[i];
}
for(int i=n-1;i>0;i--)
{ for(int j=i+1;j<=n;j++)
{ x[i][j]=1000000000;
for(int k=i;k<j;k++)
x[i][j]=min(x[i][j],x[i][k]+x[k+1][j]+l[i]*c[k]*c[j]);
}
}
out<<x[1][n];
in.close();
out.close();
return 0;
}