Cod sursa(job #2088562)
| Utilizator | Data | 15 decembrie 2017 15:01:37 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
long long d[505],dp[505][505];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1+i;j<=n;j++)
dp[i][j]=-1;
for(int i=0;i<=n;i++)
fin>>d[i];
for(int l=2;l<=n;l++)
for(int i=1;i<=n-l+1;i++)
{
int j=i+l-1;
for(int h=i;h<min(j,n);h++)
if(dp[i][j]==-1||dp[i][h]+dp[h+1][j]+d[i-1]*d[j]*d[h]<dp[i][j])
dp[i][j]=dp[i][h]+dp[h+1][j]+d[i-1]*d[j]*d[h];
}
fout<<dp[1][n];
}
