Pagini recente » summerchallenge2renasterea | Istoria paginii preoni-2006/runda-4/solutii | Cowfood | Istoria paginii runda/cei_mici3 | Cod sursa (job #2016508)
#include <iostream>
#include <fstream>
#define NMAX 5000001
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int a[501],d[501][501],n,l[501],c[501],minim,i,j,k;
int main()
{
f>>n;
for(i=1;i<=n+1;i++)
{
f>>a[i];
}
for(i=1;i<=n;i++)
{
l[i]=a[i];
c[i]=a[i+1];
d[i][i]=0;
}
for(i=n-1;i>=1;i--)
{
for(j=i+1;j<=n;j++)
{
minim=NMAX;
for(k=i;k<j;k++)
{
if(d[i][k]+d[k+1][j]+l[i]*l[k+1]*c[j]<minim)
{
minim=d[i][k]+d[k+1][j]+l[i]*l[k+1]*c[j];
}
}
d[i][j]=minim;
}
}
g<<d[1][n];
return 0;
}