Cod sursa(job #2477229)
Utilizator | Isache Catalina Kata | Data | 19 octombrie 2019 20:45:01 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#define N 5005
#define INF 100000000000000000
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int dp[N][N],v[N];
int main()
{
int n,i,j,k,dif;
fin>>n;
for (i=0; i<=n; i++)
fin>>v[i];
for (i=1; i<n; i++)
dp[i][i+1]=v[i-1]*v[i]*v[i+1];
for (dif=2; dif<n; dif++)
for (i=1; i<=n-dif; i++)
{
j=i+dif;
dp[i][j]=INF;
for (k=i; k<j; k++)
dp[i][j]=min(dp[i][j], dp[i][k]+dp[k+1][j]+ v[i-1]*v[k]*v[j]);
}
fout<<dp[1][n];
return 0;
}