LR Shirts
There are $N$ people standing in a line from left to right. The $i$-th person from the left has a height $H_i$. $H$ is a permutation of $1$ to $N$. First, you must assign each of them a shirt with the letter $L$ or $R$ on it. Then you may perform the following operation any number of times (possibly zero): - Choose a person with $L$ on their shirt and move them to the left end of the line. - Cho
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start