题目
Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) and Pop (deleting the top element). Now you are supposed to implement a stack with an extra operation: PeekMedian – return the median value of all the elements in the stack. With N elements, the median value is defined to be the (N/2)-th smallest element if N is even, or ((N+1)/2)-th if N is odd.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<= 105). Then N lines follow, each contains a command in one of the following 3 formats:
Push key
Pop
PeekMedian
where key is a positive integer no more than 105.
Output Specification:
For each Push command, insert key into the stack and output nothing. For each Pop or PeekMedian command, print in a line the corresponding returned value. If the command is invalid, print “Invalid” instead.
Sample Input:
17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop
Sample Output:
Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid
思路
尝试了多种方法,测试点2、3容易超时,最后使用以下方案。
用multiset
存储所有值,其内部是用红黑树实现,查找、插入、删除复杂度都是O(logn)。
用midit
指针指向中位数位置,利用了multiset
的如下特性:
在执行insert
操作后, midit
指向的位置不变(multiset
把值相同的元素插到后面);执行erase
操作时,只要不把midit
本身删掉, midit
指向的位置也不变;
在push和pop时,通过比较key
与*midit
的大小及当前元素总数的奇偶性,就能快速调整midit
指针的位置(左移--、右移++或不变),保证midit
永远指向中位数的位置。(具体做法见代码注释)
尝试过的其它方案有:
- 用vector记录所有元素,用插入排序的思想维护有序数列。元素循环移动覆盖耗时大,测试点3能擦边通过,测试点2超时:
- 用multiset记录所有元素,每次求中位数都使用迭代器找中间位置。set不支持随机访问,迭代到中间位置耗时太大:
柳神用了树状数组,需要学习一下:1057. Stack (30)-PAT甲级真题(树状数组)
zyq-lucky用了两个multiset的方法:PAT真题练习(甲级)1057 Stack (30 分) (使用multiset和stack实现)
代码
#include <iostream>
#include <set>
#