PAT A1057. Stack (30)
来源:互联网 发布:知豆可以开多少公里 编辑:程序博客网 时间:2024/06/01 07:16
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 <cstdio>#include <stack>#include <cstring>using namespace std;const int MAX = 100001;const int MAXN = 317;int n, block[MAXN] = {0}, table[MAX] = {0};char order[11];stack<int> s;bool cmp(int a, int b){return a < b;}int main(){scanf("%d", &n);while(n--){scanf("%s", order);if(strcmp(order, "Pop") == 0){if(!s.empty()){int k = s.top();printf("%d\n", k);s.pop();block[k/(MAXN-1)]--;table[k]--;}else printf("Invalid\n");}else if(strcmp(order, "PeekMedian") == 0){if(s.empty()){printf("Invalid\n");continue;}int k, idx = 0, index = 0;if(s.size() % 2 == 0) k = s.size()/2;else k = (s.size()+1)/2;int sum = 0;while(sum + block[idx] < k){sum += block[idx++];}index = idx * (MAXN-1);while(sum + table[index] < k){sum += table[index++];}printf("%d\n", index);}else{int k;scanf("%d", &k); s.push(k);table[k]++;block[k/(MAXN-1)]++;}}return 0;}
- PAT A1057. Stack (30)
- PAT 1057 Stack (30)
- 1057. Stack (30)-PAT
- pat 1057. Stack (30)
- PAT 1057. Stack (30)
- 【PAT】1057. Stack (30)
- PAT-Stack (30)
- PAT 1017Stack (30)
- PAT Stack (30)
- PAT 1057. Stack (30)
- PAT A 1057. Stack (30)
- PAT (Advanced) 1057. Stack (30)
- PAT(A) - 1057. Stack (30)
- 【PAT甲级】1057. Stack (30)
- PAT(A) - 1057. Stack (30)
- PAT甲级1057. Stack (30)
- PAT-A-1057. Stack (30)
- PAT 甲级 1057. Stack (30)
- 数据结构-单链表按值删除
- Pom.xml详解
- zookeeper集群搭建
- jQuery实现仿淘宝tab栏切换效果
- JavaScript基础之JSON
- PAT A1057. Stack (30)
- ios 设置webview透明背景
- IOCP完成端口的一个简单封装类
- 转 Windows+VS2013爆详细Caffe编译安装教程
- 将Linux的私钥文件.id转换为Putty的ppk文件
- Linux平台下停止后台进程脚本编写
- 数据结构与算法——希尔排序
- (JS)LeetCode之路001-Two Sum
- 定义一个2维数组3行4列,求数组平均值最大值最小值js