Pagini recente » Cod sursa (job #3244238) | Cod sursa (job #1442569) | Cod sursa (job #1663206) | Cod sursa (job #3178129) | Cod sursa (job #3237487)
#include<fstream>
using namespace std;
ifstream F("podm.in");
ofstream G("podm.out");
long long n,i,a[501],b[501][501],j,k;
int main()
{
for(F>>n;i<=n;F>>a[i++]);
for(i=1;i<n;b[i][i+1]=a[i-1]*a[i]*a[i+1],++i);
for(j=2;j<n;++j)
for(i=1;i<=n-j;++i)
for(b[i][i+j]=1e18,k=i;k<=i+j;b[i][i+j]=min(b[i][i+j],b[i][k]+b[k+1][i+j]+a[i-1]*a[k]*a[i+j]),++k);
return G<<b[1][n],0;
}