Cod sursa(job #2759473)
| Utilizator | Data | 18 iunie 2021 00:33:37 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
#define inf (1LL<<60)
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
int v[502];
long long dp[502][502];
int main()
{
f>>n;
for(int i=0; i<=n; i++) f>>v[i];
for(int i=1; i<n; i++)
dp[i][i+1]=1LL*v[i-1]*v[i]*v[i+1];
for(int pas=3; pas<=n; pas++)
{
for(int i=0; i+pas<=n; i++)
{
dp[i+1][i+pas]=inf;
for(int j=i+1; j<i+pas; j++)
dp[i+1][i+pas]=min(dp[i+1][i+pas],dp[i+1][j]+dp[j+1][i+pas]+
1LL*v[i]*v[j]*v[i+pas]);
}
}
g<<dp[1][n];
return 0;
}
