Pagini recente » Cod sursa (job #1623877) | Cod sursa (job #1732797) | Cod sursa (job #582053) | Cod sursa (job #2511070) | Cod sursa (job #1180989)
#include <fstream>
using namespace std;
inline int min(long long a,long long b)
{
if(a<=b) return a;
return b;
}
const long long inf=(1LL<<62);
ifstream fin("podm.in");
ofstream fout("podm.out");
int d[505];
long long m[505][505];
inline int podm(int n)
{ int k,i,j;
for(i=1;i<=n-1;i++)
{
m[i][i+1]=d[i-1]*d[i]*d[i+1];
}
for(k=2;k<=n;k++)
{
for(i=1;i<=n-k;i++)
{ m[i][i+k]=inf;
for(j=i;j<i+k;j++)
{
m[i][i+k]=min(m[i][i+k],m[i][j]+m[j+1][i+k]+d[i-1]*d[j]*d[i+k]);
}
}
}
return m[1][n];
}
int main()
{
int n,i;
fin>>n;
for(i=0;i<=n;i++) fin>>d[i];
fout<<podm(n);
}