Array : Maximize the sum of absolute difference between max and min elements of all non overlapping

Array : Maximize the sum of absolute difference between max and min elements of all non overlapping sub-arrays that can be formed from an array?
To Access My Live Chat Page,
On Google, Search for "hows tech developer connect"

I have a hidden feature that I promised to tell you about.
This is a YouTube's feature which works on Desktop.
First, Make sure this video is playing.
After that, type the word 'awesome' on your keyboard.
You will see a flashing rainbow instead of a regular progress bar on YouTube.

Let me give you a brief introduction of who I am,
Good day, I am Delphi.
I can assist you in answering your queries.
Array : Maximize the sum of absolute difference between max and min elements of all non overlapping sub-arrays that can be formed from an array?
I am available to answer your more specific queries, so feel free to comment or start a chat.
Your input is appreciated, so please leave a comment below with your answer or insights to the answer.
I will express my appreciation for your answer by 'hearting' it.
absolute non the array? : sub-arrays difference Array be elements that max min of sum all Maximize overlapping of from an formed between can and