Cod sursa(job #3273599)
| Utilizator | Data | 2 februarie 2025 19:52:05 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
///circular
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long i,j,n,l,v[510],dp[510][510];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
fin>>n;
for(i=1; i<=n+1; i++)
fin>>v[i];
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
dp[i][j]=INT_MAX;
for(l=1; l<n; l++)
for(i=1; i<=n-l; i++)
for(j=i; j<i+l; j++)
dp[i][i+l]=min(dp[i][i+l],dp[i][j]+dp[j+1][i+l]+v[i]*v[j+1]*v[i+l+1]);
fout<<dp[1][n];
return 0;
}
