1057. Stack (30)

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 (<= 10⁵). 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 10⁵.

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:

17PopPeekMedianPush 3PeekMedianPush 2PeekMedianPush 1PeekMedianPopPopPush 5Push 4PeekMedianPopPopPopPop

Sample Output:

InvalidInvalid322124453Invalid

c语言的输入输出+统计方法求中位数+树状数组+二分搜索。

#include <cstdio>#include <algorithm>using namespace std;const int maxn = 100005;int C[maxn],st[maxn];inline int lowbit(int x){return x & -x;}int sum(int x){int ret = 0;while(x > 0){ret += C[x]; x -= lowbit(x);}return ret;}int add(int x,int d){while(x <= maxn){C[x] += d; x += lowbit(x);}}int lower_bound(int x){int mid,low=0,high = maxn - 1;while(low < high){int mid = low + (high - low)/2;if(sum(mid) >= x)high = mid;else low = mid + 1;}return low;}int main(){int n,top = -1;scanf("%d",&n);char cmd[20];for(int i=0;i<n;i++){scanf("%s",cmd);if(cmd[1] == 'o'){if(top == -1)printf("Invalid\n");else {int t = st[top--];printf("%d\n",t);add(t,-1);}}else if(cmd[1] == 'u'){int a;scanf("%d",&a);add(a,1);st[++top] = a;}else if(cmd[1] == 'e'){int sz = top + 1;if(sz == 0)printf("Invalid\n");else if(sz % 2 == 0){printf("%d\n",lower_bound(sz/2));}else {printf("%d\n",lower_bound((sz+1)/2));}}}return 0;}