Cod sursa(job #2813847)
| Utilizator | Data | 7 decembrie 2021 11:48:19 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <algorithm>
#define INF 100000000000000000LL
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int n,dp[501][501],d[501],i,j,k,r;
int main()
{
fin>>n;
for(i=0;i<=n;i++)
{
fin>>d[i];
dp[i][i]=0;
}
for(i=1;i<=n-1;i++)
dp[i][i+1]=d[i-1]*d[i]*d[i+1];
for(r=2;r<=n-1;r++)
{
for(i=1;i<=n-r;i++)
{
int j=r+i;
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];
return 0;;
}
