Cod sursa(job #1528115)
Utilizator | elev gigel worstbyte | Data | 19 noiembrie 2015 06:16:39 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
#define INF 1000000000
int n, dim[510];
int a[512][512];
int main() {
int i, j, d, m, k;
in>>n;
for(i = 1;i<=n+1;++i)
in>>dim[i];
for(d = 1; d<=n-1;++d)
for(i = 1; i<=n-d;++i){
j = d + i;
a[i][j] = INF;
for(k=i;k<j;++k){
m=a[i][k] + a[k+1][j] + dim[i]*dim[k+1]*dim[j+1];
if(m<a[i][j])
a[i][j] = m;
}
}
out<<a[1][n];
return 0;
}