Cod sursa(job #2089658)
| Utilizator | Data | 16 decembrie 2017 21:38:32 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <cstdio>
#define MAX 1LL<<62
#include <algorithm>
using namespace std;
FILE *in=fopen("podm.in","r");
FILE *out=fopen("podm.out","w");
long long n,v[505],dp[505][505];
int main()
{
fscanf(in,"%lld",&n);
for(int i=1;i<=n+1;i++)
fscanf(in,"%lld",&v[i]);
for(int l=2;l<=n;l++)
{
for(int i=1;i<=n-l+1;i++)
{
long long j = i + l-1;
dp[i][j]=MAX;
for(int k=i;k<j;k++)
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j] + v[i] * v[k+1] * v[j+1]);
}
}
fprintf(out,"%lld",dp[1][n]);
return 0;
}
