Pagini recente » Istoria paginii runda/testround9/clasament | Cod sursa (job #2039839) | Cod sursa (job #2102670) | Cod sursa (job #687516) | Cod sursa (job #1110867)
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long v[505], d[505][505];
long long n, i, j, l, k;
int main() {
f>>n;
for(i=1;i<=n+1;i++)
f>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
d[i][j]=2000000000;
for(i=1;i<=n;i++)
d[i][i]=0;
for(l=2;l<=n;l++) {
for(i=1;i+l-1<=n;i++) {
j=i+l-1;
for(k=i;k<j;k++) {
d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+v[i]*v[k+1]*v[j+1]);
}
}
}
g<<d[1][n]<<"\n";
return 0;
}