Cod sursa(job #2456583)
| Utilizator | Data | 14 septembrie 2019 18:47:37 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
long long n,a[505];
long long dp[505][505];
int main()
{
in>>n;
n++;
for(int i=1;i<=n;i++)
{
in>>a[i];
}
for(int j=3;j<=n;j++)
{
for(int i=j-2;i>0;i--)
{
dp[i][j]=dp[i][j-1]+a[i]*a[j-1]*a[j];
for(int k=j-2;k>i;k--)
{
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]);
}
}
}
out<<dp[1][n];
return 0;
}
