Cod sursa(job #1903305)
Utilizator | Pana Claudiu Claudiu07 | Data | 5 martie 2017 09:32:32 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n, a[501];
long long d[501][501],minm;
int main()
{
f>>n;
for(int i=1; i<=n+1; i++)
f>>a[i];
for(int i=1; i<=n; i++) d[i][i]=0;
for(int i=1; i<=n-1; i++)
for(int j=1; i+j<=n; j++)
{
minm =LONG_LONG_MAX;
for(int k=j; k<i+j; k++)
{
if(minm>d[j][k]+d[k+1][i+j]+a[j]*a[k+1]*a[j+i+1]) minm=d[j][k]+d[k+1][i+j]+a[j]*a[k+1]*a[j+i+1];
}
d[j][i+j]=minm;
}
g<<d[1][n]<<'\n';
}