Mai intai trebuie sa te autentifici.
Cod sursa(job #1722936)
Utilizator | Data | 29 iunie 2016 13:34:14 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long m[501][501];
int d[501];
int main()
{
int n,i,dis,k;
long long sol;
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(dis=0;dis<n;dis++)
{
for(i=1;i<=n;i++)
{
sol=INT_MAX;
for(k=i;k<i+dis;k++)
{
sol=min(m[i][k]+m[k+1][i+dis]+(d[i-1]*d[k]*d[i+dis]),sol);
}
if(dis!=0)
m[i][i+dis]=sol;
}
}
fout<<m[1][n];
return 0;
}