Pagini recente » Cod sursa (job #2449564) | Cod sursa (job #549530) | Cod sursa (job #1052414) | Cod sursa (job #1040263) | Cod sursa (job #2003010)
#include <iostream>
#include <bits/stdc++.h>
#define NMAX 10000
#define INFILE "podm.in"
#define OUTFILE "podm.out"
#define LONGLONG 9223372036854775807
using namespace std;
ifstream in(INFILE);
ofstream out(OUTFILE);
long long P[NMAX];
long long m[NMAX][NMAX];
int N(0);
void Read(){
in>>N;
N++;
for(int i=0;i<N;i++)
in>>P[i];
}
void MinimInmultiri(){
for(int l=2;l<=N;l++){
for(int i=1;i<=N-l+1;i++){
int j=i+l-1;
m[i][j]=LONGLONG;
long long q(0);
for(int k=i;k<j;k++){
q=m[i][k]+m[k+1][j]+P[i-1]*P[k]*P[j];
if(m[i][j]>q){
m[i][j]=q;
}
}
}
}
}
long long GR(int i,int j){
if(i==j)
return 0;
if(m[i][j]!=0)
return m[i][j];
long long q=LONGLONG;
for(int k=i;k<j;k++)
q=min(q,GR(i,k)+GR(k+1,j)+P[i-1]*P[k]*P[j]);
m[i][j]=q;
return q;
}
int main()
{
Read();
GR(1,N);
out<<m[1][N-1];
return 0;
}