Pagini recente » Istoria paginii runda/gagaga | Cod sursa (job #1267875) | Cod sursa (job #2538246) | Borderou de evaluare (job #2182198) | Cod sursa (job #2148478)
#include <fstream>
#define DMAX 10001
#include <climits>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int a[DMAX][DMAX];
int d[501];
int mini(int a,int b)
{
if(a<=b)return a;
return b;
}
int n;
int main()
{
int i,j,p,k;
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(i=1;i<=n;i++)a[i][i]=0;
for(i=1;i<=n-1;i++)a[i][i+1]=d[i-1]*d[i]*d[i+1];
for(p=2;p<=n-1;p++)
{
for(i=1;i<=n-p;i++)
{
j=i+p;
a[i][j]=INT_MAX;
for(k=i;k<=j-1;k++)
{
a[i][j]=mini(a[i][j],a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j]);
}
}
}
fout<<a[1][n];
return 0;
}