从前往后每次贪心选取一个尽可能长的不同时包含 $1 \sim X$ 所有数的段令它们全相等即可。
时间复杂度为 $\mathcal{O}(N)$。
QOJ.ac
QOJ
The 3rd Universal Cup Finals is coming! Join our Warm-up Game and Prediction Game and win the prizes! Learn more...
Discussion #1344 for Problem #17422. Except Ai
Type: Editorial
Status: Open
Posted by: Milmon
Posted at: 2026-03-29 19:50:41
Last updated: 2026-03-29 19:50:46
题解
Comments
No comments yet.