Pagini recente » Cod sursa (job #2877659) | Cod sursa (job #1206804) | Cod sursa (job #1103225) | Cod sursa (job #1832458) | Cod sursa (job #1384078)
#include <fstream>
#define MX 501
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, d[MX];
long long M[MX][MX];
void Dinamic()
{
int nr,i,j,k,minim;
for(nr=2; nr<=n; nr++) //numarul de matrici ce se inmultesc
{
for(i=1; i<=n-nr+1; i++)
{
j = i+nr-1;
//se inmultesc nr matrice, de la Ai la Aj
for(k=i, minim=(1<<30); k<j; k++)
{
if(M[i][k] + M[k+1][j] + d[i-1]*d[k]*d[j] < minim)
{
minim = M[i][k] + M[k+1][j] + d[i-1]*d[k]*d[j];
}
}
M[i][j] = minim;
}
}
}
int main()
{
int i;
fin>>n;
fin>>d[0];
for(i=1; i<=n; i++) fin>>d[i];
Dinamic();
fout<<M[1][n];
fin.close(); fout.close();
return 0;
}