Pagini recente » Cod sursa (job #2150541) | Cod sursa (job #2787675) | Cod sursa (job #375893) | Cod sursa (job #2030827) | Cod sursa (job #813134)
Cod sursa(job #813134)
#include <fstream>
using namespace std;
const int DMAX = 501;
int n;
int d[DMAX];
long long int CMin[DMAX][DMAX];
void Citire();
void pd();
void afisare();
int main()
{
Citire();
pd();
afisare();
return 0;
}
void Citire()
{
ifstream fin("podm.in");
fin >> n;
int i;
for(i = 0; i <= n; i++)
{
fin >> d[i];
}
fin.close();
}
void pd()
{
int i, j, k;
long long int kmin = 0;
long long int min = 0;
for(i = 1; i <= n-1; i++)
{
CMin[i][i+1] = d[i-1] * d[i] * d[i+1];
}
for(i = 1; i <= n-1; i++)
{
for(j = 1+i; j <= n; j++)
{
k = i;
min = CMin[i][k] + CMin[k+1][j] + d[i-1] * d[k] * d[j];
kmin = k;
for(k = i; k <= j-1; k++)
{
if(CMin[i][k] + CMin[k+1][j] + d[i-1] * d[k] * d[j] < min)
{
min = CMin[i][k] + CMin[k+1][j] + d[i-1] * d[k] * d[j];
kmin = k;
}
}
CMin[i][j] = min;
CMin[j][i] = kmin;
}
}
}
void afisare()
{
int i,j;
ofstream fout("podm.out");
fout << CMin[1][n] << '\n';
fout.close();
}