CF85D:Sum of Medians(STL)
来源:互联网 发布:calendar什么软件 编辑:程序博客网 时间:2024/04/29 00:06
In one well-known algorithm of finding the k-th order statistics we should divide all elements into groups of five consecutive elements and find the median of each five. A median is called the middle element of a sorted array (it's the third largest element for a group of five). To increase the algorithm's performance speed on a modern video card, you should be able to find a sum of medians in each five of the array.
A sum of medians of a sorted k-element set S = {a1, a2, ..., ak}, where a1 < a2 < a3 < ... < ak, will be understood by as
The operator stands for taking the remainder, that is stands for the remainder of dividing x by y.
To organize exercise testing quickly calculating the sum of medians for a changing set was needed.
The first line contains number n (1 ≤ n ≤ 105), the number of operations performed.
Then each of n lines contains the description of one of the three operations:
- add x — add the element x to the set;
- del x — delete the element x from the set;
- sum — find the sum of medians of the set.
For any add x operation it is true that the element x is not included in the set directly before the operation.
For any del x operation it is true that the element x is included in the set directly before the operation.
All the numbers in the input are positive integers, not exceeding 109.
For each operation sum print on the single line the sum of medians of the current set. If the set is empty, print 0.
Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams (also you may use the %I64d specificator).
6add 4add 5add 1add 2add 3sum
3
14add 1add 7add 2add 5sumadd 6add 8add 9add 3add 4add 10sumdel 1sum
51113
给出n个操作
.add x 表示向集合中添加x(添加x的时候保证x是第一次被添加入集合)
.del x 表示从集合中删除x (删除x的时候保证x存在于集合中)
.sum 将集合排序后,询问集合里面所有下标i % 5 = 3的元素的和(如果集合为空输出0)
思路:直接用vector做,插入和删除用二分,就不用排序了。
# include <iostream># include <cstdio># include <vector># include <algorithm>using namespace std;vector<int>v;int main(){ int n, t; char s[10]; scanf("%d",&n); while(n--) { scanf("%s",s); if(s[0] == 's') { long long ans = 0; for(int i=2; i<v.size(); i+=5) ans += v[i]; printf("%I64d\n",ans); } else { scanf("%d",&t); if(s[0] == 'a') v.insert(lower_bound(v.begin(), v.end(), t), t); else v.erase(lower_bound(v.begin(), v.end(), t)); } } return 0;}
- CF85D:Sum of Medians(STL)
- CF85D Sum of Medians
- Sum of Medians
- CodeForces 85 D.Sum of Medians(线段树)
- CF 85D Sum of Medians
- Codeforces 85D Sum of Medians
- codeforces85D——Sum of Medians
- hdu 4288 Coder & CF85-D Sum of Medians (单点更新)
- CodeForces 85D Sum of Medians(线段树 + 离散化)
- hdoj 4288coder & cf 85d Sum of Medians
- CF-85D-Sum of Medians(线段树)
- Codeforces 85D Sum of Medians(线段树)
- Codeforces 85D Sum of Medians(线段树)
- Codeforces 85D Sum of Medians[线段树]
- median of medians(中位数的中位数)
- SGU - 358 - Median of Medians (寻找中位数中的中位数)
- hdu 4288 线段树 Sum of Medians 像lazysales girl Coder
- .hdu4288 Coder & CF85-DSum of Medians
- 哈希查找
- idea自动跟新jsp文件
- angularJS-05
- 自定义View获取dimen值得三个方法:getDimension,getDimensionPixelOffset和getDimensionPixelSize
- PAT A1118 birds in forest (25)
- CF85D:Sum of Medians(STL)
- java jar包加密保护解决方案
- 数据库索引的大概意思
- ARM基础 课程概述
- 输入输出外一些常用函数
- Android Studio logcat 常用功能
- angularJS06
- UVA 10951
- ubuntu 12.04固定IP设置