Pagini recente » Cod sursa (job #244511) | Cod sursa (job #1876789) | Cod sursa (job #422760) | Cod sursa (job #2047832) | Cod sursa (job #2495635)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
long long tip[505];
long long rasp[505][505];
int main()
{
f>>n;
int i,j,k;
for(i=0; i<=n; i++) f>>tip[i];
for(i=1; i<=n-1; i++)
rasp[i][i+1]=tip[i-1]*tip[i]*tip[i+1];
for(j=2; j<=n-1; j++)
for(i=1; i<=n-j; i++)
{
rasp[i][i+j]=100000000000000000;
for(k=i; k<=i+j-1; k++)
rasp[i][i+j]=min(rasp[i][i+j],rasp[i][k]+rasp[k+1][i+j]+tip[i-1]*tip[k]*tip[i+j]);
}
//Deci, ...
g<<rasp[1][n];
return 0;
}