Cod sursa(job #2497913)
| Utilizator | Data | 23 noiembrie 2019 12:14:58 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n;
long long a[510];
long long dp[510][510];
long long INF=1ll<<60;
int main()
{
in>>n;
for(int i=1;i<=n+1;i++)
in>>a[i];
for(int i=n;i>=1;i--){
for(int j=1;j<=n;j++){
long long mini=INF;
for(int k=i;k<j;k++)
if(mini>dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1])
mini=dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1];
if(i!=j)
dp[i][j]=mini;
else
dp[i][j]=0;
}
}
out<<dp[1][n];
return 0;
}
