Pagini recente » Cod sursa (job #2080883) | Cod sursa (job #2885589) | Cod sursa (job #2179544) | Monitorul de evaluare | Cod sursa (job #1289025)
#include<fstream>
#define INF 2000000000
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,i,j,k,d;
long long D[501][501],v[501];
int min(int a,int k,int i,int j){
int S;
S=D[i][k]+D[k][j]+v[i]*v[k]*v[j];
if(a>S)
return S;
else
return a;
}
int main(){
fin>>n;
n++;
for(i=1;i<=n;i++)
fin>>v[i];
for(d=2;d<=n-1;d++){
for(i=1;i+d<=n;i++){
j=i+d;
D[i][j]=INF;
for(k=i+1;k<j;k++){
D[i][j]=min(D[i][j],k,i,j);
}
}
}
fout<<D[1][n];
return 0;
}