Cod sursa(job #1160123)
| Utilizator | Data | 30 martie 2014 12:06:29 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
#define INF 18446744073709551615
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
unsigned long long m[501][501];
int i,n,l,k,j;
int v[501];
int main()
{
f>>n;
for (i=0;i<=n;++i) f>>v[i];
for (l=2;l<=n;++l)
for (i=1;i<=n-l+1;++i)
{
j=i+l-1;
m[i][j]=INF;
for (k=i;k<=j-1;++k)
{
unsigned long long q=m[i][k]+m[k+1][j]+v[i-1]*v[k]*v[j];
if (q<m[i][j]) m[i][j]=q;
}
}
g<<m[1][n]<<'\n';
}
