Moving Lights | MatCom Online Grader

The 5th Cuban Programming League (Real Contest)

Ended

Overview
Problems
Standing
Submissions
Submit
Clarifications
Virtual participation

Register

Are you sure you want to participate in this contest ? If you select a team then virtual participation for other team members will be disabled. So, pick one if and only if your teammates are ready to compete with you.

I - Moving Lights

Languages: C++, Java, Python, Kotlin

Time & Memory limits: (details)

<p style='text-align: justify;'>
Jesus is a volunteer in the organization of his graduation ceremony. The ceremony will consist of a big show with amateur artists. Jesus has been tasked with preparing the lights that will be used during the presentation. To fulfill his task, a friend has lent him an old lighting equipment. The equipment consists of several colored lights, placed on rails in such a way that they can be raised or lowered to form various designs. All the lights work, but the mechanism for moving them is damaged, so any changes must be made manually.

Jesus wants the final design to have a **subsequence** with at least K consecutive increasing height lights by 1. The lights do not have to be in consecutive positions. For example, $[\textbf{5},\textbf{6}, 3,\textbf{7}]$ and $[\textbf{-2},3,\textbf{-1},\textbf{0}]$ have 3 consecutive increasing height lights, but $[5,7,9]$ and $[4,3,2]$ only have $1$ valid light, because there are no two lamps with consecutive increasing heights.

The actions that Jesus can take are to decrease or increase the height of one of the lights by one level at a time. It is possible for a light to have a negative height, this only means that it will be below the central level of the lighting equipment. As moving each light is difficult, Jesus wants to make the least possible number of actions to obtain the desired design. Can you help him determine it?
</p>

Input

Output

Sample test(s)

Input

3 2 4 8 12

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

--- Showing first 30 lines (click "Copy" to get full content) ---

Input

4 2 5 10 2 6

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

--- Showing first 30 lines (click "Copy" to get full content) ---

Matcom Online Grader

The 5th Cuban Programming League (Real Contest)

Ended

I - Moving Lights

Languages: C++, Java, Python, Kotlin

Time & Memory limits: (details)

Input

Output

Sample test(s)

Notes