Pagini recente » Cod sursa (job #984015) | Cod sursa (job #1785165) | Cod sursa (job #1381637) | Cod sursa (job #772717) | Cod sursa (job #1260700)
#include<algorithm>
#include<fstream>
using namespace std;
#define inf 1LL<<60
ifstream f("podm.in");
ofstream g("podm.out");
int n;
long long a[501][501],v[505];
void citire(){
f>>n;
for(int i=0;i<=n;++i)
f>>v[i];
}
void pd(){
for(int d=1;d<n;++d)
for(int i=1;i<n-d;++i){
int j=i+d;
a[i][j]=1ll*20000000*20000000;
for(int k=i;k<j;++k)
a[i][j]=min(a[i][j],a[i][k]+a[k+1][j]+v[i-1]*v[k]*v[j]);
}
}
int main(){
citire();
pd();
g<<a[1][n]<<'\n';
g.close();
return 0;
}