Cod sursa(job #2800868)
| Utilizator | Data | 14 noiembrie 2021 11:35:33 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long a[501],dp[501][501];
int main()
{
int n;
f>>n;
for(int i=0; i<=n; i++)
f>>a[i];
for(int len=2; len<=n; len++)
for(int i=1,j=len; j<=n; i++, j++)
{
dp[i][j] = 1e18;/// 1e18 = infinit
for(int 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]);
}
}
g<<dp[1][n];
return 0;
}
