Cod sursa(job #714820)
| Utilizator | Data | 16 martie 2012 11:01:34 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
const int N=505;
long long a[N][N];
int v[N];
ifstream in("podm.in");
ofstream out("podm.out");
int main()
{
int n,i,j,k;
long long min=9223372036854775807LL,m;
in>>n;
for(i=1;i<=n+1;i++)
in>>v[i];
for(i=n;i>=1;i--)
for(j=i+1;j<=n;j++)
{
min=9223372036854775807LL;
for(k=i;k<j;k++)
{
m=a[i][k]+a[k+1][j]+(long long)v[i]*v[k+1]*v[j+1];
if(m<min)
min=m;
}
a[i][j]=min;
}
out<<a[1][n];
return 0;
}
