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 (≤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
方法1:分块
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int maxn=100010;
const int sqrN=316;
stack<int> st;
int block[sqrN];
int table[maxn]; //hash数组
void peekMedian(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 x,n;
char str[20];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",str);
if(strcmp(str,"Push")==0){
scanf("%d",&x);
push(x);
}else if(strcmp(str,"Pop")==0){
if(st.empty()) printf("Invalid\n");
else pop();
}else{ //取中位数
if(st.empty()) printf("Invalid\n");
else{
int k=st.size();
if(k%2==1) k=(k+1)/2;
else k=k/2;
peekMedian(k);
}
}
}
return 0;
}
方法2:树状数组+二分 思路挺简单的,直接看代码吧,
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#define lowbit(i) ((i) & (-i))
const int maxn = 100010;
using namespace std;
int c[maxn];
stack<int> s;
void update(int x, int v) {
for(int i = x; i < maxn; i += lowbit(i))
c[i] += v;
}
int getsum(int x) {
int sum = 0;
for(int i = x; i >= 1; i -= lowbit(i))
sum += c[i];
return sum;
}
void PeekMedian() {
int left = 1, right = maxn, mid, k = (s.size() + 1) / 2;
while(left < right) {
mid = (left + right) / 2;
if(getsum(mid) >= k)
right = mid;
else
left = mid + 1;
}
printf("%d\n", left);
}
int main(){
int n, temp;
scanf("%d", &n);
char str[15];
for(int i = 0; i < n; i++) {
scanf("%s", str);
if(str[1] == 'u') {
scanf("%d", &temp);
s.push(temp);
update(temp, 1);
} else if(str[1] == 'o') {
if(!s.empty()) {
update(s.top(), -1);
printf("%d\n", s.top());
s.pop();
} else {
printf("Invalid\n");
}
} else {
if(!s.empty())
PeekMedian();
else
printf("Invalid\n");
}
}
return 0;
}