Company: phonepe_30july
Difficulty: medium
Juice Blending Showdown Problem Description You're participating in a unique juice blending competition. There are N different juice containers placed in a line. Each container has a number written on it, which represents its flavour strength. At every step of the contest, a container can absorb one of its adjacent neighbours, i.e. either the one to its left or the one to its right. When this happens: The neighbour container disappears The absorbing container updates its intensity to: current strength - neighbours strength The process continues until there's only one container left. Your goal is to maximize the final flavour strength of the last remaining container by choosing the best possible sequence of absorptions. Input The first line contains an integer n, the number of juice containers The second line contains n integers a₁, a₂, ..., aₙ, indicating the flavour strength of the containers Output Print the maximum possible flavour strength that you can achieve by mixing the juice c