## Editorial for Singularity Cup P1 - Maximum Permutation Product

Remember to use this editorial

**only**when stuck, and**not to copy-paste code from it**. Please be respectful to the problem author and editorialist.**Submitting an official solution before solving the problem yourself is a bannable offence.**Author:

#### Subtask 1

We can compute the value of every possible subarray and determine which one yields the highest value.

**Time complexity:**

#### Subtask 2

When , it is always optimal to include the entire array excluding if or .

is an edge case where choosing the subarray that only contains the element is always optimal.

**Time complexity:**

## Comments