该博客介绍了CodeForces 821C 题目'Okabe and Boxes'，讨论如何在模拟栈操作过程中，根据指定顺序要求最小化重排次数。文章解释了题意，即在执行添加和移除盒子的操作中，如何在允许的重排条件下，确保按照1到n的顺序移除盒子。博主分享了思路，即在需要重排时直接清空栈，并统计非目标值栈顶时的重排次数。
C. Okabe and Boxes
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Okabe and Super Hacker Daru are stacking and removing boxes. There are n boxes numbered from 1 to n. Initially there are no boxes on the stack.
Okabe, being a control freak, gives Daru 2n commands: n of which are to add a box to the top of the stack, and n of which are to remove a box from the top of the stack and throw it in the trash. Okabe wants Daru to throw away the boxes in the order from
最低0.47元/天 解锁文章
扫一扫
526
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
