Pagini recente » Cod sursa (job #702621) | Cod sursa (job #189036) | Cod sursa (job #2135796) | Cod sursa (job #1413332) | Cod sursa (job #1746608)
#include <fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
#define MAXN 505
#define INF 100000000000000000LL
long long bst[MAXN][MAXN], d[MAXN];
int n,i,w,j,k;
int main()
{
f>>n;
for (i=0;i<=n;i++) f >> d[i];
for (i=1;i<=n;i++) bst[i][i] = 0;
for (i=1;i<=n-1;i++) bst[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
for (w=2;w<=n-1;w++)
for(i=1;i<=n-w;i++)
{
int j = i + w;
bst[i][j] = INF;
for (k=i;k<=j-1;k++)
bst[i][j] = min(bst[i][j], bst[i][k] + bst[k + 1][j] + d[i - 1] * d[k] * d[j]);
}
g << bst[1][n];
return 0;
}