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
#include <iostream>
#include <stack>
#define lowbit(x) x&(-x)
const int maxn = 100010; //因为这里是10的5次方,写成了10010,少写个0,测试点2、3、4不过 找问题找了好久,so要细心
using namespace std;
stack<int> s;
int c[maxn];
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)
{//用二分法找因为是getsum是递增的。
mid = (left + right) / 2;
if (getsum(mid) >= k)
{
right = mid;
}
else
{//为何输出是left可以调试在理解理解
left = mid + 1;
}
}
cout << left << endl;//while结束时,left==right所以写left或者right都一样
}
int main()
{
freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
char str[15];
for (int i = 0; i < n; i++)
{
int value;
scanf("%s", str);
if (str[1] == 'u')
{//因为value是小于10的五次方,所以不一定是一位数,开始的思路用str[5]代表值是不对的。
scanf("%d", &value);
update(value, 1);
s.push(value);
}
else if (str[1] == 'o')
{
if (!s.empty())
{
cout << s.top() << endl;
update(s.top(), -1);//因为pop了,所以要将这个数减去并进行更新
s.pop();
}
else
{
cout << "Invalid" << endl;
}
}
else
{
if (!s.empty())
{
peekMedian();
}
else
{
cout << "Invalid" << endl;
}
}
}
return 0;
}