1057. Stack
来源:互联网 发布:微软软件开发流程 编辑:程序博客网 时间:2024/06/15 08:59
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 <cstdlib>#include <iostream>#include <deque>#include <queue>#include <cstring>#include <vector>#include <string>#include <iomanip>#include <map>#include <set>#include <cmath>#include <stack>#include <cmath>#include <algorithm>using namespace std;#define inf 100010#define lowbit(i) ((i)&(-i))stack<int>s;int c[inf];void update(int x, int v) { for(int i = x; i < inf; 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 = inf, mid, k = (s.size() + 1) / 2; while(left < right) { mid = (left + right) / 2; if(getsum(mid) >= k) right = mid; else left = 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(); else printf("Invalid\n"); } } return 0;}
- 1057. Stack
- 1057. Stack
- 1057. Stack
- 1057. Stack
- 1057.Stack
- 1057. Stack
- 1057. Stack
- 1057. Stack (30)-PAT
- 1057. Stack (30)
- 1057. Stack (30)
- PAT 1057. Stack
- PAT 1057. Stack
- 1057. Stack (30)
- 1057. Stack (30)
- pat 1057. Stack (30)
- 1057. Stack (30)--看
- 1057. Stack (30)
- PAT 1057. Stack (30)
- 121. Best Time to Buy and Sell Stock | 买股票的利润
- 开源PLM软件Aras详解七 在Aras的Method中如何引用外部DLL
- Docker的安装配置及使用详解
- NYOJ23 取石子(一)
- 编程前的准备--jdk环境变量配置
- 1057. Stack
- C# Graphics.FillEllipse 方法
- 别混淆了sizeof(数组名)和sizeof(指针)
- ALGO-34 算法训练 纪念品分组
- 回调函数与C++中类成员作为回调函数
- LeetCode 45 --- Jump Game II
- Linux下的特殊权限s t i a
- java编程思想第10章内部类 总结(1)
- java:当父类无无参构造函数并且有其他构造函数时,子类不能调用默认构造函数