1057 Stack (30分) [树状数组]

最新推荐文章于 2022-09-05 15:43:08 发布

chen_zan_yu_

最新推荐文章于 2022-09-05 15:43:08 发布

阅读量180

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT (甲级) Practice PAT

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/105720579

PAT 同时被 2 个专栏收录

224 篇文章

订阅专栏

PAT (甲级) Practice

121 篇文章

订阅专栏

本文介绍了一种使用树状数组实现栈数据结构的方法，该方法能够在进行基本的push和pop操作的同时，还能够高效地查询当前栈中所有元素的中位数。通过具体的输入输出示例和C++代码实现，展示了如何处理各种命令，包括在栈为空时返回无效操作。

摘要生成于 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

树状数组入门(简单的原理讲解)

#include<bits/stdc++.h>
using namespace std;
#define lowbit(i) ((i)&(-i))
const int maxn=100010;
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 l=1,r=maxn,mid,k=(s.size()+1)/2;
    while(l<r)
    {
        mid=(l+r)/2;
        if(getsum(mid)>=k)
        {
            r=mid;
        }
        else
            l=mid+1;
    }
    printf("%d\n",l);
}
int main()
{
    int n,temp;
    scanf("%d",&n);
    char str[16];
    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;
}