Pagini recente » Cod sursa (job #2293711) | Cod sursa (job #156276) | Cod sursa (job #93999) | Cod sursa (job #1931361) | Cod sursa (job #3268589)
#include <iostream>
#include <fstream>
using namespace std;
const long long MININF=1e18;
long long j,k,kmin,mini,p,n,c[110][110],d[110];
ifstream f("podm.in");
ofstream g("podm.out");
int main() {
f>>n;
for(int i=0; i<=n; i++) {
f>>d[i];
}
for(int p=1; p<=n; p++) {
for(int i=1; i<=n-p; i++) {
j=i+p;
mini=MININF;
kmin=-1;
for(int k=i; k<=j-1; k++) {
if(mini>c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j]) {
mini=c[i][k]+c[k+1][j]+d[i-1]*d[k]*d[j];
kmin=k;
}
c[i][j]=mini;
c[j][i]=kmin;
}
}
}
g<<c[1][n];
return 0;
}