题目描述
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 (≤
1
0
5
10^5
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 10 5 10^5 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.
样例输入
17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop
样例输出
Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid
实现代码(区间查询)
#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
const int maxn = 1e5 + 10;
const int sqrN = 316;
stack<int> st;
int block[sqrN];
int table[maxn];
void peerMedium(int K) {
int sum = 0; //当前累计存在的数的个数
int idx = 0; //当前块号
while(sum + block[idx] < K) {
sum += block[idx++];
}
int num = idx * sqrN;
while(sum + table[num] < K) {
sum += table[num++];
}
printf("%d\n", num);
}
void push(int x) {
st.push(x);
block[x / sqrN]++;
table[x]++;
}
void pop() {
int x = st.top();
st.pop();
block[x / sqrN]--;
table[x]--;
printf("%d\n", x);
}
int main() {
int N, x;
char cmd[20];
memset(block, 0, sizeof(block));
memset(table, 0, sizeof(table));
scanf("%d", &N);
for(int i = 0; i < N; i++) {
scanf("%s", cmd);
if(strcmp(cmd, "Push") == 0) {
scanf("%d", &x);
push(x);
} else if(strcmp(cmd, "Pop") == 0) {
if(st.size() != 0) {
pop();
} else {
printf("Invalid\n");
}
} else if(strcmp(cmd, "PeekMedian") == 0) {
int num = st.size();
if(num != 0) {
int K;
if(num % 2 == 1) {
K = (num + 1) / 2;
} else {
K = num / 2;
}
peerMedium(K);
} else {
printf("Invalid\n");
}
}
}
return 0;
}