1057 Stack (30 分) （线段树找第N小的数）

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​5​​). 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​5​​.

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

 题目大意：写一个自己的栈，实现三个功能

• push，不输出
• pop，并打印
• PeekMedian，找中位数（奇数 size()/2，偶数(size()+1)/2———>等价于全部(size()+1)/2）

注意：纯用STL+排序 超时，考虑用线段树组

模板如下：（lowbit 由来详见 PPT）

int lowbit(int x){
	return (x&(-x));
}

void update(int x,int v){
	for(int i=x;i<maxn;i+=lowbit(i))  //lowbit(i) 
		c[i]+=v;
}
int getSum(int x){
	int res=0;
	for(int i=x;i>=1;i-=lowbit(i))
		res+=c[i];
	return res;
}
void PeekMedian(){       //二分查找模板
	int left=1,right=maxn,mid,k=(st.size()+1)/2;
	while(left<right){                               
		mid=(left+right)/2;
		if(getSum(mid)>=k) right=mid;
		else left=mid+1;
	}
	cout<<left<<endl;
}