Pagini recente » Cod sursa (job #1321042) | Cod sursa (job #2882159) | Cod sursa (job #2369401) | Cod sursa (job #2296706) | Cod sursa (job #2815612)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, v[502] , lenght;
long long d[502][502];
long long calcul (int st, int dr)
{
if (dr-st==1)
{
d[st][dr]=0;
return 0;
}
if(d[st][dr]!=LLONG_MAX)
{
return d[st][dr];
}
int k=st+1;
long long result=v[st] * v[k] * v[dr] + calcul(st, k) + calcul(k, dr);
for (k=st+2; k<dr; k++)
{
result = min(result, v[st] * v[k] * v[dr] + calcul(st, k) + calcul(k, dr));
}
d[st][dr]=result;
return result;
}
int main()
{
fin>>n;
n++;
for (int i=1; i<=n; i++)
{
for (int j=i; j<=n; j++)
{
d[i][j]=LLONG_MAX;
}
}
for (int i=1; i<=n; i++)
{
fin>>v[i];
}
fout<<calcul(1,n);
return 0;
}