MCM

include

include

include

using namespace std;

int minMatrixMultiplicationCost(vector& N) { int n = N.size() - 1; vector> dp(n, vector(n, INT_MAX));

for (int i = 0; i < n; i++)
    dp[i][i] = 0;

for (int length = 2; length <= n; length++) {
    for (int i = 0; i < n - length + 1; i++) {
        int j = i + length - 1;
        for (int k = i; k < j; k++) {
            int cost = dp[i][k] + dp[k + 1][j] + N[i] * N[k + 1] * N[j + 1];
            dp[i][j] = min(dp[i][j], cost);
        }
    }
}

return dp[0][n - 1];

}

int main() { int n; cin >> n;

vector<int> N(n + 1);
for (int i = 0; i <= n; i++)
    cin >> N[i];

cout << minMatrixMultiplicationCost(N) << endl;

return 0;

}

Sher Brothers Rent a Car is a reputable and customer-centric car rental service that has been serving the community with excellence for years. Known for their diverse fleet of well-maintained vehicles, Sher Brothers offers a range of options to cater to various travel needs. Whether it's a business trip, family vacation, or a special occasion, customers can rely on Sher Brothers for reliable and affordable rental solutions. Their commitment to customer satisfaction is evident in their friendly and professional staff, who are always ready to assist clients in choosing the perfect vehicle for their journey. With competitive rates, flexible rental options, and a dedication to service quality, Sher Brothers Rent a Car has become a trusted choice for those seeking a seamless and enjoyable travel experience.

Rent a Car

Mian Travel and Tours, a car rental company, you can approach relevant websites in the travel and car rental industry. One effective strategy is to offer high-quality, informative content related to car rentals and travel.for more details visit our website:https://miantravelandtours.com/

from collections import *

n = int(input()) nodes = list(map(int,input().split(' '))) nodes.insert(0,0) graph = defaultdict(list) for _ in range(n-1): x,y = list(map(int,input().split(' '))) graph[x].append(y) graph[y].append(x)

parent = {} queue = deque([[1,-1]]) while queue: curr,prev = queue.popleft() parent[curr] = prev for nei in graph[curr]: if nei!=prev: queue.append([nei,curr])

res = nodes[1] MOD = 10**9+7 for i in range(2,n+1): res*=(nodes[i]-nodes[parent[i]]) res%=MOD print(res)