1057. Stack 解析

这个题注意peek media的时候输出的中值，而且题目对时间的要求比较高，一直排序时间跟不上的。

甚至我用了string都超时了..尴尬..（没有用树状数组）

参考了：http://blog.csdn.net/gemire/article/details/21644347 里面提供的用两个set维护的方法，感觉理解起来简单些。树状数组的思维很厉害，但理解起来比较难。

正好对set不熟悉，可以练练手。

两个set维护 

8.6更新  发现代码贴错了。。。改过来了

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>

#define MAX 100010

using namespace std;

int n;
//string opnow;
char opnow[20];
vector <int> s;
multiset<int,greater<int> > low;//set默认是最小堆
multiset <int> high;
int mid = 0;


int main(){
	
	scanf("%d",&n);
	for(int i =0 ;i < n ;i++){
		scanf("%s",opnow);

		if(opnow[1] == 'o'){
			if(s.size() == 0)
				cout << "Invalid" << endl;
			else{
				int t = s[s.size()-1];
				cout << t << endl;
				s.pop_back();

				//删除set中的元素
				if(t > *low.begin())
					high.erase(high.find(t));
				else
					low.erase(low.find(t));
			
				if(s.size()==0)	//栈为空重置mid
					mid = 0;
				else{//维护两个set保证中值在low中					
					if(high.size() > low.size()){
						low.insert(*high.begin());
						high.erase(high.begin());
					}
					else if(high.size() + 1 < low.size()){
						high.insert(*low.begin());
						low.erase(low.begin());
					}
					mid = *low.begin();
				}
			}
		}

		if(opnow[1] == 'e'){
			if(s.size() == 0)
				cout << "Invalid" << endl;
			else{
				cout << *low.begin() << endl;
			}
		}

		if(opnow[1] == 'u'){
			int t;
			cin >> t;
			s.push_back(t);
			
			//两个set 来求中值
			if(t > mid)
				high.insert(t);
			else
				low.insert(t);

			//维护两个set保证中值在low中
			if(high.size() > low.size()){
				low.insert(*high.begin());
				high.erase(high.begin());
			}
			else if(high.size() + 1 < low.size()){
				high.insert(*low.begin());
				low.erase(low.begin());
			}
			mid = *low.begin();
		}
	}

	return 0;
}

树状数组：

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <algorithm>
#include <cstring>

#define MAX 100010

using namespace std;

int s[MAX];
int ts[MAX];
int TreeArry[MAX]; //树状数组 a1到ai有多少个数
int top = 0, tail = 0;
int Size = 0;
int n;
char p1[11] = "Pop";
char p2[11] = "PeekMedian";
char p3[11] = "Push";

struct op {
	char p[11];
};

bool isEmpty() {
	return top == tail;
}

int lowbit(int num) { //求num的二进制最低位 
	return num&(-num); //num与自身负数补码按位与 例如 2  0010 补 1010 按位与就是 0010
}

//树状数组
//T1 = A1
//T2 = A1 + A2
//T3 = A3
//T4 = A1 + A2 + A3 + A4
//T5 = A5
//T6 = A5 + A6
//T7 = A7
//T8 = A5 + A6 + A7 + A8

void Update(int n, int times) { //times计数
	while (n < MAX) {			//更新计数 树状数组的更新很有意思
		TreeArry[n] += times;	//比如更新 a3 则T3 T4 T8会有影响 对应二进制
		n += lowbit(n);			//0011->0100->1000
	}							//计算方法是 0001(lowbit) + 0011 = 0100
}								// 0100(lowbit) + 0100 = 1000 即所谓的n += lowbit(n)

int GetSum(int n) {				//获取前面有多少元素
	int sum = 0;				//比如获取3之前有多少
	while (n > 0) {				//则需要累加T3 T2
		sum += TreeArry[n];		//0011->0010
		n -= lowbit(n);			//计算方法 0011 - 0001(lowbit) = 0010
	}
	return sum;
}

int TreeArrySerch(int num) { //从a1到ai的数的数目 = Size /2 则为中位数
	int l = 0, r = MAX;
	int mid = 0;
	while (l <= r) {
		mid = (l + r) / 2;
		int sum = GetSum(mid); //mid之前有多少数(小的在前)
		if (num > sum) { 		
			l = mid + 1;
		}
		else if (num < sum) {
			r = mid - 1;
		}
		else
			r = mid - 1;
	}
	return l;
}


void Operation(op p) {
	if (strcmp(p.p, p1) == 0) {//pop
		if (isEmpty()) //Empty
			cout << "Invalid" << endl;
		else {
			Update(s[top], -1);
			cout << s[top--] << endl;
			Size--;
		}
	}
	else if (strcmp(p.p, p3) == 0) {//push
		int key;
		scanf("%d", &key);
		Update(key, 1);
		s[++top] = key;
		Size++;
	}
	else if (strcmp(p.p, p2) == 0) {//mid
		if (isEmpty()) //Empty
			cout << "Invalid" << endl;
		else {
			int midp = TreeArrySerch((Size + 1) / 2);
			cout << midp << endl;
		}
	}
}


int main() {

	cin >> n;

	op p;
	for (int i = 0; i < n; i++) {
		scanf("%s", p.p);
		Operation(p);
	}

	return 0;
}