Pagini recente » Cod sursa (job #1258065) | Cod sursa (job #786706) | Cod sursa (job #495287) | Cod sursa (job #2485411) | Cod sursa (job #2861977)
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
unsigned long long a[511][511];
int n,i,j,k,l,m[511];
int main()
{
f>>n;
for(i=0;i<=n;i++)
f>>m[i];
for(k=2;k<=n;k++)
for(i=1,j=k;i<=n-k+1;i++,j++)
{
a[i][j]=-1;
for(l=1;l<k;l++)
a[i][j]=min(a[i][j],a[i][j-l]+a[i+k-l][j]+m[i-1]*m[j-l]*m[j]);
}
g<<a[1][n];
return 0;
}