PAT(甲级)1057
来源:互联网 发布:简单java单线程程序 编辑:程序博客网 时间:2024/06/04 01:05
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 keyPop
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:17PopPeekMedianPush 3PeekMedianPush 2PeekMedianPush 1PeekMedianPopPopPush 5Push 4PeekMedianPopPopPopPopSample Output:
InvalidInvalid322124453Invalid
//#include"stdafx.h"#include<stdio.h>#include<cstring>#include<iostream>#include<string>using namespace std;const int N=6;int c[N];/////////////////////////////////////////////////////use tree array to solve this problem///////////////////////////////////////////////////////calculate 2^k,which is the range dominated by c[n]int lowbit(int i){return i&(-i);}//calculate c[] c[n]= a[n-2^k+1]+...a[n]void add(int pos,int value){while(pos<N){c[pos]+=value;pos+=lowbit(pos);}}//calculate the sun of a[1],a[2]...a[n]int sum(int pos){int res=0;while(pos>0){res+=c[pos];pos-=lowbit(pos);}return res;}int find(int value){ //value here is also an indexint l=0,r=N-1,median,res;while(l<r-1){if((l+r)%2==0)median=(l+r)/2;elsemedian=(l+r-1)/2;res=sum(median);if(res<value)l=median;else r=median;}return l+1;}int main(){//freopen("1057.txt","r",stdin);//freopen("out.txt","w",stdout);char ss[20];int stack[N],top=0,n,pos;memset(c,0,sizeof(c));scanf("%d",&n);while(n--){scanf("%s",ss);if(ss[1]=='u'){scanf("%d",&pos);stack[++top]=pos;add(pos,1); //every date inputted is considered as an index, just to fast pinpoint!}else if(ss[1]=='o'){if(top==0){printf("Invalid\n");continue;}int out=stack[top];add(out,-1);printf("%d\n",stack[top--]);}else if(ss[1]=='e'){if(top==0){printf("Invalid\n");continue;}int res;if(top%2==0)res=find(top/2);elseres=find((top+1)/2);printf("%d\n",res);}else{printf("Invalid\n");}}return 0;}
- PAT(甲级)1057
- PAT甲级1057
- PAT 甲级
- **浙大PAT甲级 1057 树状数组+二分法
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- C++ Primer Plus第六版 第十一章 编程练习答案
- java 抽象类和接口
- PAT(甲级)1056
- Perl 类继承简单讲解
- Number of 1 Bits
- PAT(甲级)1057
- 283:Move Zeroes
- 树的深度优先与广度优先遍历
- Java反射通过class获取父类泛型类型
- log4j配置
- JMS学习
- C++ string类型的split字符串分割函数
- 线段树查询
- 用硕鼠下载土豆视频