Cod sursa(job #574662)
| Utilizator | Data | 7 aprilie 2011 13:46:25 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
using namespace std;
#include<fstream>
short d[550];
long long m[510][510];
int main()
{int i,j,h,k,n;
ifstream in("podm.in");
in>>n;
for(i=0;i<=n;i++)
in>>d[i];
for(i=1;i<=n-1;i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<=n-1;j++)
for(i=1;i<=n-j;i++)
{h=i+j;
m[i][h]=1LL<<63;
for(k=i;k<=h-1;k++)
m[i][h]=min(m[i][h],m[i][k]+m[k+1][h]+d[i-1]*d[k]*d[h]);
}
ofstream out("podm.out");
out<<m[1][n]<<'\n';
out.close();
return 0;
}
