Mai intai trebuie sa te autentifici.
Cod sursa(job #2303018)
Utilizator | Data | 15 decembrie 2018 13:43:07 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
#include <climits>
#define INF 100000000000000000LL
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n, a[501];
unsigned long long d[501][501],minm;
int main()
{
f>>n;
for(int i=0; i<=n; i++)
f>>a[i];
for(int i=1; i<=n; i++) d[i][i]=0;
for(int j=1; j<=n-1; j++)
d[j][j+1]=a[j-1]*a[j]*a[j+1];
for(int i=2; i<=n-1; i++)
for(int j=1; j<=n-i; j++)
{
minm =INF;
for(int k=j; k<i+j; k++)
{
if(minm>d[j][k]+d[k+1][i+j]+a[j-1]*a[k]*a[j+i])
minm=d[j][k]+d[k+1][i+j]+a[j-1]*a[k]*a[j+i];
}
d[j][i+j]=minm;
}
g<<d[1][n]<<'\n';
}