设为首页 加入收藏

TOP

hdu4288 离线处理线段树(二)
2015-07-22 20:10:19 来源: 作者: 【 】 浏览:40
Tags:hdu4288 处理 线段
lar since the advent of cheap and reliable computers. Many companies now employ a single coder to write an algorithm that will replace many other employees. An added benefit to the employer is that the coder will also become redundant once their work is done. 1   You are now the signle coder, and have been assigned a new task writing code, since your boss would like to replace many other employees (and you when you become redundant once your task is complete). Your code should be able to complete a task to replace these employees who do nothing all day but eating: make the digest sum.   By saying “digest sum” we study some properties of data. For the sake of simplicity, our data is a set of integers. Your code should give response to following operations:   1. add x – add the element x to the set;   2. del x – remove the element x from the set;   3. sum – find the digest sum of the set. The digest sum should be understood by
\
  where the set S is written as {a 1, a 2, ... , a k} satisfying a 1 < a 2 < a 3 < ... < a k   Can you complete this task (and be then fired)? ------------------------------------------------------------------------------ 1 See http://uncyclopedia.wikia.com/wiki/Algorithm Input   There’re several test cases.   In each test case, the first line contains one integer N ( 1 <= N <= 10 5 ), the number of operations to process.   Then following is n lines, each one containing one of three operations: “add x” or “del x” or “sum”.   You may assume that 1 <= x <= 10 9.   Please see the sample for detailed format.   For any “add x” it is guaranteed that x is not currently in the set just before this operation.   For any “del x” it is guaranteed that x must currently be in the set just before this operation.   Please process until EOF (End Of File). Output   For each operation “sum” please print one line containing exactly one integer denoting the digest sum of the current set. Print 0 if the set is empty. Sample Input
9
add 1
add 2
add 3
add 4
add 5
sum
add 6
del 3
sum
6
add 1
add 3
add 5
add 7
add 9
sum

Sample Output
3
4
5
HintC++ maybe run faster than G++ in this problem. 
首页 上一页 1 2 下一页 尾页 2/2/2
】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇LeetCode54/59 Spiral Matrix I/II 下一篇ZOJ 3706 Break Standard Weight ..

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: