PAT 甲级 1057. Stack (30)
来源:互联网 发布:西安交大远程网络教育 编辑:程序博客网 时间:2024/06/08 20:44
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 <iostream>#include <vector>#include <algorithm>#include <cstring>#include <stack>#include <queue>#define lowbit(i) ((i)&(-i))using namespace std;const int maxn = 100010;int c[maxn];stack<int> s;void update(int x, int v) {for (int i = x; i < maxn; i += lowbit(i))c[i] += v;}int getsum(int x) {int sum = 0;for (int i = x; i >= 1; i -= lowbit(i))sum += c[i];return sum;}void peekMedian() {int left = 1, right = maxn, mid, k = (s.size() + 1) / 2;while (left < right) {mid = (left + right) / 2;if (getsum(mid) >= k)right = mid;elseleft = mid + 1;}printf("%d\n", left);}int main() {int n, temp;scanf("%d", &n);char str[15];for (int i = 0; i < n; i++) {scanf("%s", str);if (str[1] == 'u') {scanf("%d", &temp);s.push(temp);update(temp, 1);}else if (str[1] == 'o') {if (!s.empty()) {update(s.top(), -1);printf("%d\n", s.top());s.pop();}else {printf("Invalid\n");}}else {if (!s.empty())peekMedian();elseprintf("Invalid\n");}}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) 中位数;树状数组
- leetcode---combination-sum---dfs
- K:注解处理
- 栈的实现及应用学习笔记--Java实现
- 通过Exiv2读取照片的Exif信息获取GPS,焦距等信息
- seaborn单变量、多变量及回归分析绘图
- PAT 甲级 1057. Stack (30)
- iPhone8可以无线充电吗?绿联无线充电器充电功率实测
- php mysql 获得表记录的总数及获取指定数量的数据
- 创建Hibernate获取Session的工具类
- 乒乓球:浅析业余高手从输球中总结的10条心得!
- 简单选择排序
- Catch That Cow bfs
- [BZOJ]4364: [IOI2014]wall砖墙 线段树
- 《重构 改善既有代码的设计》读书笔记一