#PU1280. USACO 2023 January Contest, Silver — Problem 3. Moo Route
USACO 2023 January Contest, Silver — Problem 3. Moo Route
USACO 2023 January Contest, Silver — Problem 3. Moo Route
题目描述
Farmer Nhoj dropped Bessie in the middle of nowhere! At time , Bessie is located at on an infinite number line. She frantically searches for an exit by moving left or right by unit each second. However, there actually is no exit and after seconds, Bessie is back at , tired and resigned. Farmer Nhoj tries to track Bessie but only knows how many times Bessie crosses , given by an array (, , ). Bessie never reaches nor . In particular, Bessie's route can be represented by a string of s and s where the th character represents the direction Bessie moves in during the th second. The number of direction changes is defined as the number of occurrences of s plus the number of occurrences of s. Please help Farmer Nhoj find any route Bessie could have taken that is consistent with and minimizes the number of direction changes. It is guaranteed that there is at least one valid route.
输入格式
The first line contains . The second line contains .
输出格式
(见题面原文)
数据范围
Inputs 3-5: Inputs 3-10: Inputs 11-20: No additional constraints. Problem credits: Brandon Wang and Claire Zhang
样例
样例 1
2
2 4
RRLRLL
There is only 1 valid route, corresponding to the route
$0\to 1 \to 2 \to 1\to 2 \to 1\to 0$. Since this is the only possible route, it
also has the minimum number of direction changes.
样例 2
3
2 4 4
RRRLLRRLLL
There are 3 possible routes:
RRLRRLRLLL
RRRLRLLRLL
RRRLLRRLLL
The first two routes have 5 direction changes, while the last one has only 3.
Thus the last route is the only correct output.