pat1057. Stack (30)

1057. Stack (30)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (<= 10⁵). 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⁵.

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

---

提交代码

注意点：

1.树状数组的常见操作

学习：

http://www.cnblogs.com/zhangshu/archive/2011/08/16/2141396.html

http://blog.csdn.net/eli850934234/article/details/8863839

 int lowbit(int val){
     return val&(-val);
 }
 int sum(int val){
     int res=;
     while(val>){
         res+=line[val];
         val-=lowbit(val);
     }
     return res;
 }
 void add(int val,int x){
     while(val<maxnum){
         line[val]+=x;
         val+=lowbit(val);
     }
 }
 int find(int val){
     int l=,r=maxnum,mid,res;
     while(l<r){//右边取不到
         mid=(l+r)/;
         res=sum(mid);
         if(res<val){
             l=mid+;//(1)
         }
         else{
             r=mid;//[l,r)的每一点求sum，一定小于sum(r)，最终一定终止于(1)。最后返回l。
         }
     }
     return l;
 }

这里要注意二分查找的书写。对于区间[a,b)，不断二分，最后返回l。

2.string的操作一般要比char的操作时间长。这里用的string会超时。

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<stack>
 #include<set>
 #include<map>
 #include<algorithm>
 using namespace std;
 #define maxnum 100005
 int line[maxnum];
 int lowbit(int val){
     return val&(-val);
 }
 int sum(int val){
     int res=;
     while(val>){
         res+=line[val];
         val-=lowbit(val);
     }
     return res;
 }
 void add(int val,int x){
     while(val<maxnum){
         line[val]+=x;
         val+=lowbit(val);
     }
 }
 int find(int val){
     int l=,r=maxnum,mid,res;
     while(l<r){//右边取不到
         mid=(l+r)/;
         res=sum(mid);
         if(res<val){
             l=mid+;
         }
         else{
             r=mid;
         }
     }
     return l;
 }
 int main(){
     //freopen("D:\\INPUT.txt","r",stdin);
     int n,num;
     char op[];
     //string op;
     stack<int> s;
     scanf("%d",&n);
     while(n--){
         scanf("%s",op);//cin>>op;
         if(op[]=='u'){
             scanf("%d",&num);
             s.push(num);
             add(num,);
         }
         else{
             if(op[]=='o'){
                 if(s.empty()){
                     printf("Invalid\n");
                 }
                 else{
                     num=s.top();
                     s.pop();
                     printf("%d\n",num);
                     add(num,-);
                 }
             }
             else{
                 if(s.size()==){
                     printf("Invalid\n");
                     continue;
                 }
                 if(s.size()%==){
                     num=find(s.size()/);
                 }
                 else{
                     num=find((s.size()+)/);
                 }
                 printf("%d\n",num);
             }
         }
     }
     return ;
 }