A1057 Stack

Posted on | In |

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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
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
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//push的是正数 c[1] c[2]这样才有值 
#include<iostream>
#include<stack>
using namespace std;
stack<int> s;
#define maxn 100010
int c[maxn];

int lowbit(int x){
	return x&(-x);
}
int getSum(int x){
	int sum=0;
	for(int i=x;i>0;i-=lowbit(i)){
		sum+=c[i];
	}
	return sum;
}
void update(int x,int v){
	for(int i=x;i<=maxn;i+=lowbit(i)){
		c[i]+=v;
	}
}
//求中位数! 
void PeekMedian(){
	int l=1,r=maxn;
	int k=(s.size()+1)/2;
	while(l<r){
		int mid=(l+r)/2;
		if(getSum(mid)>=k){
			r=mid;
		}
		else{
			l=mid+1;
		}
	}
	cout<<l<<endl;
}
int main(){
	int n;
	//freopen("t1.txt","r",stdin);
	cin>>n;
		int x;
	string str;
	int i=0;
	while(i<n){
		cin>>str;
		if(str=="Pop"){
			if(s.empty()) cout<<"Invalid"<<endl;
			else {
				cout<<s.top()<<endl;
				update(s.top(),-1);
				s.pop();
			}
		}
		else if(str=="Push"){
			cin>>x;
			s.push(x);
			update(x,1);
		}
		else if(str=="PeekMedian"){
				if(s.empty()) cout<<"Invalid"<<endl;
			 else PeekMedian();
		}
		i++;
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>
#include<stack>
using namespace std;
stack<int> s;

#define maxn 100010
int c[maxn];

int lowbit(int x){
	return x&(-x);
}
int getSum(int x){
	int sum=0;
	for(int i=x;i>0;i-=lowbit(i)){
		sum+=c[i];
	}
	return sum;
}
void update(int x,int v){
	for(int i=x;i<maxn;i+=lowbit(i)){
		c[i]+=v;
	}
}
void PeekMedian(){
	int l=0,r=maxn,ans;
	int k=(s.size()+1)/2;
	while(l<=r){
		int mid=(l+r)/2;
		if(getSum(mid)>k){
			r=mid-1;
		}
		else if(getSum(mid)==k) ans=mid;
		else{
			l=mid+1;
		}
	}
	cout<<ans<<endl;
}
int main(){
	int n;
	cin>>n;
	string str;
	int i=0;
	while(i<n){
		cin>>str;
		if(str=="Pop"){
			if(s.empty()) cout<<"Invalid"<<endl;
			else {
				cout<<s.top()<<endl;
				update(s.top(),-1);
				s.pop();
			}
		}
		else if(str=="Push"){
			int x;
			cin>>x;
			s.push(x);
			update(x,1);
		}
		else if(str=="PeekMedian"){
				if(s.empty()) cout<<"Invalid"<<endl;
			 PeekMedian();
		}
		
		
		
		
		i++;
	}
	
	
	
	
}