Cod sursa(job #1776198)
| Utilizator | Data | 10 octombrie 2016 23:59:59 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include<fstream>
#define inf 100000000000000000LL
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n,i,j,k;
long long m[510][510],d[510];
int main()
{
f>>n;
for(i=0;i<=n;i++)
f>>d[i];
for(i=1;i<n;i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<n;j++)
for(i=1;i<=n-j;i++)
{
m[i][i+j]=inf;
for(k=i;k<i+j;k++)
if(m[i][k] + m[k+1][i+j] + d[i-1]*d[k]*d[i+j] < m[i][i+j])
m[i][i+j]=m[i][k] + m[k+1][i+j] + d[i-1]*d[k]*d[i+j];
}
g<<m[1][n];
}
