Cod sursa(job #1892999)
| Utilizator | Data | 25 februarie 2017 13:56:25 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#define NMAX 505
#define infinit 2000000000
using namespace std;
long long D[NMAX],m[NMAX][NMAX],min1;
int n,i,k,d;
ifstream f("podm.in");
ofstream g("podm.out");
int main()
{
f>>n;
for(i=0;i<=n;i++)
f>>D[i];
for(i=1;i<n;i++)
m[i][i+1]=D[i-1]*D[i]*D[i+1];
for(d=2;d<n;d++)
for(i=1;i<=n-d;i++){
min1=infinit;
for(k=i;k<i+d;k++){
long long a=m[i][k]+m[k+1][i+d]+D[i-1]*D[k]*D[i+d];
if(a<min1)
min1=a;
}
m[i][i+d]=min1;
}
g<<m[1][n];
return 0;
}
