程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> 1057. Stack (30)[棧+樹狀數組]——PAT (Advanced Level) Practise

1057. Stack (30)[棧+樹狀數組]——PAT (Advanced Level) Practise

編輯:關於C++

題目信息

1057. Stack (30)

時間限制100 ms
內存限制65536 kB
代碼長度限制16000 B

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 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.

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

解題思路

vector維護stack,排序或nth_element均會超時,此處用樹狀數組維護個數,a[i]記錄值不大於i 的數共幾個,進而二分找出中間值,

AC代碼

#include 
#include 
#include 
using namespace std;
int n, t;
int a[100005];
vector vec;
inline int lowbit(int p){
    return p & (-p);
}
void add(int p, int v){
    while (p <= 100000){
        a[p] += v;
        p += lowbit(p);
    }
}
int sum(int p){
    int s = 0;
    while (p >= 1){
        s += a[p];
        p -= lowbit(p);
    }
    return s;
}
int find(int num){
    int b = 0, e = 100000, m;
    while (b < e){
        m = (b + e)/2;
        if (sum(m) >= num){
            e = m;
        }else{
            b = m + 1;
        }
    }
    return e;
}
int main()
{
    char s[20];
    scanf("%d", &n);
    while (n--){
        scanf("%s", s);
        if (s[1] == 'o'){
            if (vec.size() == 0){
                printf("Invalid\n");
            }else{
                add(vec[vec.size() - 1], -1);
                printf("%d\n", vec[vec.size() - 1]);
                vec.pop_back();
            }
        }else if (s[1] == 'u'){
            scanf("%d", &t);
            vec.push_back(t);
            add(t, 1);
        }else if (s[1] == 'e'){
            if (vec.size() == 0){
                printf("Invalid\n");
            }else{
                t = find((vec.size() + 1)/2);
                printf("%d\n", t);
            }
        }
    }
    return 0;
}
  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved