Cod sursa(job #2665851)
| Utilizator | Data | 31 octombrie 2020 13:35:52 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,d[505],i,l,st,dr,k;
unsigned long long dp[505][505];
int main()
{
fin>>n;
for(i=1; i<=n+1; i++)
fin>>d[i];
for(i=1; i<=n; i++)
dp[i][i+1]=d[i]*d[i+1]*d[i+2];
for(l=3; l<=n; l++)
for(st=1, dr=l; dr<=n ; st++, dr++)
{
dp[st][dr]=-1;
for(k=st; k<=dr; k++)
dp[st][dr]=min(dp[st][dr],dp[st][k]+dp[k+1][dr]+d[st]*d[k+1]*d[dr+1]);
}
fout<<dp[1][n];
return 0;
}
