Pagini recente » Cod sursa (job #2810789) | Cod sursa (job #2164877) | Cod sursa (job #2839726) | Borderou de evaluare (job #280147) | Cod sursa (job #1424230)
#include <iostream>
#include <fstream>
#define LL long long
using namespace std;
LL v[1000];
LL b[1024][1024];
int n;
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(int i=0; i<=n; i++)
{
f>>v[i];
cout<<v[i]<<" ";
}
for(int i=0; i<n-1; i++)
{
b[i][i+2]=v[i]*v[i+1]*v[i+2];
}
for (int lg=3; lg<=n; lg++)
for (int i=0; i+lg<=n; i++)
{
int j=i+lg;
LL bst=(1LL<<60);
for (int k=i+1; k<j; k++)
bst=min(bst,b[i][k]+b[k][j]+v[i]*v[k]*v[j]);
b[i][j]=bst;
}
g<<b[0][n];
return 0;
}