Cod sursa(job #3349020)
| Utilizator | Data | 24 martie 2026 23:16:24 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#define nmax 502
#define inf 1e18
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
int n,a[nmax];
long long dp[nmax][nmax];
int main()
{
cin>>n;
for(int i=1;i<=n+1;i++){
cin>>a[i];
if(i>2)
dp[i-2][i]=1ll*a[i-2]*a[i-1]*a[i];
}
for(int l=2;l<=n;l++)
for(int i=1;i+l-1<=n;i++){
int j=i+l-1;
dp[i][j]=inf;
for(int k=i;k<j;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+1ll*a[i]*a[k+1]*a[j+1]);
}
cout<<dp[1][n];
return 0;
}
