Cod sursa(job #2942994)
| Utilizator | Data | 20 noiembrie 2022 14:07:44 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long int a[510],n,dp[510][510];
int main()
{
int i,j,len,k;
f>>n;
for(i=0; i<=n; i++)
f>>a[i];
for(len=2; len<=n; len++)
{
i=1;
j=len;
while(j<=n)
{
dp[i][j]=999999999999999999;
for(k=i; k<j; k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);
i++;
j++;
}
}
g<<dp[1][n]<<'\n';
}
