Pagini recente » Cod sursa (job #958911) | Cod sursa (job #2935051) | Cod sursa (job #476901) | Cod sursa (job #1328080) | Cod sursa (job #606136)
Cod sursa(job #606136)
#include <cstdio>
#include <fstream>
using namespace std;
const long long oo=(long long)1<<60;
inline long long min(long long x,long long y){
return x<y?x:y;}
int main ()
{
long long m[501][501],v[501];
int n,k,i,j,d;
ifstream f ("podm.in");
freopen ("podm.out","w",stdout);
f>>n;
for(i=0;i<=n;++i){
f>>v[i];
for(j=0;j<=n;++j)
m[i][j]=oo;
m[i][i]=0;
}
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j){
d=j-i;
for(k=d;k<j;++k)
m[d][j]=min(m[d][j],m[d][k]+m[k+1][j]+v[d-1]*v[k]*v[j]);
}
printf("%lld",m[1][n]);
return 0;}