Cod sursa(job #2070655)
| Utilizator | Data | 19 noiembrie 2017 19:53:10 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#define inf 1000000000
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long d[505],dp[505][505],i,j,n,p,k;
int main()
{fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(i=1;i<=n;i++)
dp[i][i]=0;
for(i=2;i<=n;i++)
dp[i-1][i]=d[i-2]*d[i-1]*d[i];
for(p=3;p<=n;p++)
{for(i=1;i<=n-p+1;i++)
{j=i+p-1;
dp[i][j]=inf;
for(k=i;k<=j-1;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+d[i-1]*d[k]*d[j]);
}
}
fout<<dp[1][n];
}
