matrix_chain_multiplication

#include<bits/stdc++.h>
using namespace std;

#define int long long int

static int t[100][100];


int solve(int arr[], int i, int j)
{
	if (i >= j)
		return t[i][j] = 0;
	if (t[i][j] != -1)
		return t[i][j];

	int min_ = INT_MAX, temp;
	for (int k = i; k < j; k++)
	{
		temp = solve(arr, i, k) + solve(arr, k + 1, j) + arr[i - 1] * arr[k] * arr[j];
		min_ = min(min_, temp);
	}
	return t[i][j] = min_;
}

signed main()
{
	// int arr[]={40,20,10,15,30};

	int n;
	cin >> n;
	int arr[n];
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	// int n = sizeof(arr) / sizeof(arr[0]);
	memset(t, -1, sizeof(t));

	cout << solve(arr, 1, n - 1) << endl;
}