Cod sursa(job #2129497)
Utilizator | Data | 12 februarie 2018 21:07:06 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define inf 2e18
using namespace std;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
int n,i,j,k,L,v[510];
long long D[510][510];
int main(){
fin>>n;
for(i=1;i<=n+1;i++)
fin>>v[i];
for(L=3;L<=n+1;L++)
for(i=1;i+L-1<=n+1;i++){
j=i+L-1;
D[i][j]=inf;
for(k=i+1;k<=j-1;k++)
D[i][j]=min(D[i][j],D[i][k]+D[k][j]+1LL*v[i]*v[j]*v[k]);
}
fout<<D[1][n+1];
}