### 摊还分析与一道例题

摊还分析与一道例题

$$worst-casebound\ge amortizedbound\ge average-casebound$$
分析方法

• aggregate analysis 聚合分析
• accounting mothod 核算法
• potential method 势能函数法

题目：(来自浙江大学PTA，作者叶德社老师）
A queue can be implemented by using two stacks $S_A$ and $S_B$ as follows:

• • To enqueue x, we push x onto $S_A$ .
• • To dequeue from the queue, we pop and return the top item from $S_B$ . However, if $S_B$ is empty, we first fill it (and empty $S_A$ ) by popping the top item from