1057 Stack （30 分）

最新推荐文章于 2020-03-27 16:05:48 发布

原创最新推荐文章于 2020-03-27 16:05:48 发布 · 507 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#树状数组 #PAT #二分

PAT练习同时被 2 个专栏收录

62 篇文章

订阅专栏

树状数组

4 篇文章

订阅专栏

本文介绍了一种在栈数据结构中实现额外的PeekMedian操作的方法，该操作返回栈中所有元素的中位数。通过使用树状数组和二分搜索，避免了直接排序的高时间复杂度，实现了高效查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

这里因为要寻找整个数组的中值，并且数组范围为1e5，所以这里使用sort感觉一定是会超时的，所以换用树状数组，和求逆序数的思路类似，这里寻找位置为前面有(_end+1)/2-1个数字的点，所以可以采用二分搜索的方法

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long ll;
const int MAXN = 101000;

char s[10];
int a[MAXN],num;
int tree[MAXN];

void Invalid(){
    printf("Invalid\n");
}

void add(int i,int x)
{
    while(i < MAXN){
        tree[i] += x;
        i += i&-i;
    }
}

int read(int pos)
{
    int sum = 0;
    while(pos > 0){
        sum += tree[pos];
        pos -= pos & -pos;
    }
    return sum;
}
int _Binary(int pos){
    int L = 0,R = MAXN;
    while(L <= R)
    {
        int mid = (L+R) >> 1;
        int num = read(mid);
        if(num > pos)
            R = mid - 1;
        else if(num <= pos)
            L = mid + 1;
    }
    return L;
}
int main()
{
    int _end = 0;
    int n;
    scanf("%d",&n);
    for(int i = 0;i < n;i ++)
    {
        scanf("%s",s);
        if(strcmp(s,"Pop") == 0)
        {
            if(_end == 0)
                Invalid();
            else
                printf("%d\n",a[--_end]),add(a[_end],-1);
        }
        else if(strcmp(s,"PeekMedian") == 0)
        {
            if(_end == 0)
                Invalid();
            else{
                printf("%d\n",_Binary((_end+1)/2-1));   //寻找节点前有(_end+1)/2-1 个数字比当前小的点
            }
        }
        else
        {
            scanf("%d",&num);
            a[_end++] = num;
            add(num,1);
        }
    }
}