PAT甲级1057. Stack (30)
来源:互联网 发布:淘宝联盟怎么生成图文 编辑:程序博客网 时间:2024/05/17 20:33
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
树状数组.
sort排序只能做对第一个和最后一个测试点,其他的都超时。
http://www.educity.cn/develop/476845.html
https://www.lyeec.me/binary-index-tree/
#include <cstdio>using namespace std;#include <stack>const int MAX=100000+10;int c[MAX]={0};int Lowbit(int t){ return t&(-t);}int Sum(int end){ int sum=0; while(end>0){ sum+=c[end]; end-=Lowbit(end); } return sum;}void Update(int pos,int num){ while(pos<MAX){ c[pos]+=num; pos+=Lowbit(pos); }}void PeekMedian(int index){ int left=1,right=MAX-1; while(left<right){ int mid=(left+right)/2; if(Sum(mid)>=index) right=mid; else left=mid+1; } printf("%d\n",left);}int main(){ int N; scanf("%d",&N); stack<int> S; for(int i=0;i<N;i++){ char command[11]; scanf("%s",command); if(command[1]=='o') { if(S.empty()) printf("Invalid\n"); else { Update(S.top(),-1); printf("%d\n",S.top()); S.pop(); } } else if(command[1]=='u'){ int Key; scanf("%d",&Key); S.push(Key); Update(Key,1); } else{ int n=S.size(); if(n==0) { printf("Invalid\n"); continue; } int cnt=(n%2==0)?(n/2):((n+1)/2); PeekMedian(cnt); } } return 0;}
- 【PAT甲级】1057. Stack (30)
- PAT甲级1057. Stack (30)
- PAT 甲级 1057. Stack (30)
- PAT甲级练习1057. Stack (30)-未完成
- 1057. Stack (30)-PAT甲级真题(树状数组)
- 1057. Stack (30)-PAT
- pat 1057. Stack (30)
- PAT 1057. Stack (30)
- 【PAT】1057. Stack (30)
- PAT 1057. Stack (30)
- PAT A 1057. Stack (30)
- PAT (Advanced) 1057. Stack (30)
- PAT(A) - 1057. Stack (30)
- PAT(A) - 1057. Stack (30)
- PAT-A-1057. Stack (30)
- PAT甲级 1004 27/30
- 浙大2013复试:PAT 1057. Stack (30)
- PAT 1057. Stack (30) 中位数;树状数组
- Android捕获应用的异常信息-封装的很好的工具类
- C++基础1:4种类型转换
- XML之Well-Formed文档规则
- JavaScript面向对象编程指南--第一章 面向对象的JavaScript
- 在ccs7下进行DM6467的开发(1):测试工程
- PAT甲级1057. Stack (30)
- 搭建vs2008 64位程序及驱动开发环境
- 计算结构体成员偏移量
- bzoj 3401 && bzoj 1657 单调栈
- gulp入门(7)- gulp-concat
- apk图片廋身
- 500mi收银机
- 数组
- xilinx wiki