Cod sursa(job #2503325)
| Utilizator | Data | 2 decembrie 2019 20:58:25 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
int n;
long long d[505];
long long m[505][505];
int main(){
cin>>n;
for(int i=0;i<=n;i++)
cin>>d[i];
for(int i=0;i<=n-2;i++)
for(int j=i+2;j<=n;j++)
m[i][j]=~(1LL<<63);
for(int i=n-2;i>=0;i--)
for(int j=i+2;j<=n;j++)
for(int k=i+1;k<=j-1;k++)
m[i][j]=min(m[i][j],m[i][k]+m[k][j]+d[i]*d[k]*d[j]);
cout<<m[0][n];
}
