Pagini recente » Cod sursa (job #2401841) | Cod sursa (job #1440352) | Cod sursa (job #1687461) | Cod sursa (job #2256809) | Cod sursa (job #1745101)
#include <iostream>
#include <fstream>
#define NMAX 510
#include <climits>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
long long dim[NMAX];
long long a[NMAX][NMAX];
void citire(){
f >> n;
for(int i=0;i<=n;i++) f >> dim[i];
}
long long optimMA(){
for(long i=1;i<=n;i++) a[i][i]=0;
long long q;
for(long lenM=2;lenM <=n;lenM++){
for(long i=1;i<=n-lenM+1;i++){
long j = i + lenM - 1;
a[i][j] = LLONG_MAX;
for(long k=i;k<=j-1;k++){
q = a[i][k] + a[k+1][j] + dim[i-1] * dim[k] * dim[j];
if(q < a[i][j])
a[i][j] = q;
}
}
}
return a[1][n];
}
long long optim(int i,int j){
long long cate;
if(i == j) a[i][j]=0;
else if(a[i][j] < LLONG_MAX) return a[i][j];
else
for(int k=i;k<j;k++){
cate = optim(i,k) + optim(k+1,j) + dim[i-1] * dim[k] * dim[j];
if(cate < a[i][j]) a[i][j] = cate;
}
return a[i][j];
}
int main()
{
citire();
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
a[i][j] = LLONG_MAX;
g << optim(1,n);
return 0;
}