Cod sursa(job #2434595)
Utilizator | andrei42O andrei42O | Data | 2 iulie 2019 12:30:15 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
const int N =501;
int64_t d[N],s[N][N];
int n,i,j,k,m;
int main()
{
f>>n;
for(int i=0;i<=n;i++)
f>>d[i];
for(int i=1;i<n;i++)
s[i][i+1]=d[i-1]*d[i]*d[i+1];
for(m=3;m<=n;m++)
for(i=1,j=m;j<=n;i++,j++)
{
s[i][j]=d[i-1]*d[i]*d[j]+s[i+1][j];
s[i][j]=min(s[i][j],s[i][j-1]+d[i-1]*d[j-1]*d[j]);
for(k=i+1;k<j;k++)
s[i][j]=min(s[i][j],s[i][k]+s[k+1][j]+d[i-1]*d[k]*d[j]);
}
g<<s[1][n];
return 0;
}