HDU 5349 MZL's simple problem
2015-08-04 20:29
295 查看
Problem Description
A simple problem
Problem Description
You have a multiple set,and now there are three kinds of operations:
1 x : add number x to set
2 : delete the minimum number (if the set is empty now,then ignore it)
3 : query the maximum number (if the set is empty now,the answer is 0)
Input
The first line contains a number N (N≤106),representing
the number of operations.
Next N line
,each line contains one or two numbers,describe one operation.
The number in this set is not greater than 109.
Output
For each operation 3,output a line representing the answer.
Sample Input
Sample Output
简单题,注意最小值判断
A simple problem
Problem Description
You have a multiple set,and now there are three kinds of operations:
1 x : add number x to set
2 : delete the minimum number (if the set is empty now,then ignore it)
3 : query the maximum number (if the set is empty now,the answer is 0)
Input
The first line contains a number N (N≤106),representing
the number of operations.
Next N line
,each line contains one or two numbers,describe one operation.
The number in this set is not greater than 109.
Output
For each operation 3,output a line representing the answer.
Sample Input
6 1 2 1 3 3 1 3 1 4 3
Sample Output
3 4
简单题,注意最小值判断
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<string> #include<cmath> #include<queue> #include<vector> #include<map> #include<set> using namespace std; const int maxn = 60505; int a, b, T, x; int main() { scanf("%d", &T); a = -0x7FFFFFFF; b = 0; while (T--) { scanf("%d", &x); if (x == 1) { scanf("%d", &x); if (x > a) a = x; b++; } else if (x == 2) { if (b) b--; if (!b) a = -0x7FFFFFFF; } else printf("%d\n", b ? a : b); } return 0; }
相关文章推荐
- 【LIS】【dp[i] 表示长度为i时候的最小值】
- zoj 题目分类
- 【BZOJ 2154】Crash的数字表格
- 《高质量程序设计指南C/C++语言 》 林锐,韩永泉编著 总结1
- OpenGL ES 剪裁
- 页面呈现-文字修饰
- Browser caching
- 【HDU1520】【Anniversary party】
- 【数位dp】
- 数据类型范围【常识性编码知识】
- Mysql在大型网站的应用架构演变
- Spring基于 Annotation 的简单介绍
- 【数字加减】
- 【HDU1513】【Palindrome】
- 杀死指定的一个shell脚本
- C语言编程入门——综合练习(四)上机考试题
- Python日期时间Date/Time
- JAVA同步机制中用到的锁的思想
- 最大似然估计法
- 剑指Offer面试题24(Java版):二叉搜索树的后序遍历序列