PAT甲级-1057 Stack (30分)

题目：1057 Stack (30分)

分析：暴力会超时，这题有两种解法，分别为分块思想和树状数组。

解法一：分块思想（点我！）

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
#define MAX 999999999
using namespace std;
int n,m,k;
int table[100001];
int block[317];
int main()
{
    stack<int>s;
    cin>>n;
    while(n--)
    {
        string order;
        cin>>order;
        if(order == "Push")
        {
            int x;
            cin>>x;
            s.push(x);
            table[x] ++;
            block[x / 316] ++;
        }
        if(order == "Pop")
        {
            if(s.size() == 0)
                cout<<"Invalid\n";
            else{
                cout<<s.top()<<endl;
                int x = s.top();
                s.pop();
                table[x] --;
                block[x / 316] --;
            }
        }
        if(order == "PeekMedian")
        {
            if(s.size() == 0)
                cout<<"Invalid\n";
            else{
                int k = s.size();
                if(k % 2 == 0)
                    k /= 2;
                else
                    k = (k + 1) / 2;
                int sum = 0;//当前累计的数的个数
                int idx = 0;//第K大数所在的块号
                while(sum + block[idx] < k)//找到第K大数所在块号
                    sum += block[idx++];
                int num = idx * 316;//idx号块的第一个数
                while(sum + table[num] < k)
                    sum += table[num++];
                cout<<num<<endl;

            }
        }
    }
    return 0;
}

解法二：树状数组（点我！）

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
#define MAX 999999999
using namespace std;
int n,m,k;
int c[100001];
int lowbit(int x)
{
    return x&(-x);
}
int getSum(int x)//返回前x个整数之和
{
    int sum = 0;
    for(int i = x; i > 0;i -= lowbit(i))//注意是i > 0不是>=
        sum += c[i];
    return sum;
}
void update(int x, int v)//将第x个整数加上v
{
    for(int i = x;i < 100001; i += lowbit(i))//写成i<=n也可
        c[i] += v;
}
int main()
{
    stack<int>s;
    cin>>n;
    while(n--)
    {
        string order;
        cin>>order;
        if(order == "Push")
        {
            int x;
            cin>>x;
            s.push(x);
            update(x, 1);
        }
        if(order == "Pop")
        {
            if(s.size() == 0)
                cout<<"Invalid\n";
            else{
                update(s.top(), -1);
                cout<<s.top()<<endl;
                s.pop();
            }
        }
        if(order == "PeekMedian")
        {
            if(s.size() == 0)
                cout<<"Invalid\n";
            else{
                int k = (s.size() + 1) / 2;
                int left = 1;
                int right = 100001;
                int mid ;//这里用二分来查找
                while(left < right)
                {
                    mid = (left + right) / 2;
                    if(getSum(mid) >=k)
                        right = mid;
                    else
                        left = mid + 1;
                }
                cout<<left<<endl;;
            }
        }
    }
    return 0;
}