Cod sursa(job #1289064)
| Utilizator | Data | 9 decembrie 2014 13:58:06 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#define INF 100000000000
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long v[505],n,i,j,D[505][505],d,k;
int main(){
fin>>n;
for(i=1;i<=n+1;i++)
fin>>v[i];
n++;
for(d=2;d<=n-1;d++){
for(i=1;i+d<=n;i++){
j=i+d;
D[i][j]=INF;
for(k=i+1;k<=j-1;k++)
D[i][j]=min(D[i][j],v[i]*v[k]*v[j]+D[i][k]+D[k][j]);
}
}
fout<<D[1][n];
fin.close();fout.close();
return 0;
}
