Cod sursa(job #795334)
Utilizator | Data | 8 octombrie 2012 12:45:16 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
long long i,k,j,a[555][555],d[555],n,minim;
int main()
{
in>>n;
for(i=1;i<=n+1;++i)
in>>d[i];
for(i=n;i;--i)
for(j=i+1;j<=n;++j)
{
minim=2000000000000000LL;
for(k=i;k<j;++k)
{
if(a[i][k]+a[k+1][j]+d[i]*d[k+1]*d[j+1]<minim)
minim=a[i][k]+a[k+1][j]+d[i]*d[k+1]*d[j+1];
}
a[i][j]=minim;
}
out<<a[1][n];
return 0;
}