Coder(暴力)
来源:互联网 发布:我知我行征文 编辑:程序博客网 时间:2024/05/22 12:28
Description
In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become increasing popular 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
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).
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
9add 1add 2add 3add 4add 5sumadd 6del 3sum6add 1add 3add 5add 7add 9sum
Sample Output
345
解题思路:
本来该题是应该用线段树来做的,可实在是无思路,就暴力来解了,没想到竟然AC了,但程序也跑了8000多毫秒。等日后有了思路,再用线段树做一遍。
注意:插入元素的同时就得进行排序。
AC代码:
#include <iostream>#include <cstdio>using namespace std;const int maxn = 100005;int a[maxn];int main(){ int n, j, b, len; __int64 sum; char ord[10]; while(scanf("%d", &n) != EOF) { len = 0; for(int i = 0; i < n; i++) { scanf("%s", ord); if(ord[0] != 's') { scanf("%d", &b); if(ord[0] == 'a') { int i; for(i = len + 1; i >= 2; i--) { if(b < a[i - 1]) a[i] = a[i - 1]; else break; } a[i] = b; len++; } else { bool isFind = false; for(int i = 1; i < len; i++) { if(a[i] == b) { a[i] = a[i + 1]; isFind = true; } if(isFind) a[i] = a[i + 1]; } len--; } } else { sum = 0; for(int i = 3; i <= len; i += 5) sum += a[i]; printf("%I64d\n", sum); } } } return 0;}
0 0
- Coder(暴力)
- HDU 4288 Coder(线段树或者暴力vector)#by zh
- HDU 4288 Coder (技巧性暴力模拟+二分||线段树+离线操作)
- HDU 4288 Coder 线段树||暴力
- HDU4288:Coder(线段树单点更新版 && 暴力版)
- coder&client(转载)
- Coder(线段树)
- Coder
- coder
- Coder
- coder
- Coder
- coder vs creator(漫画)
- HDU 4288-Coder(模拟)
- hdu 4288 Coder (离线)
- Best Coder Matrix(数学)
- hdu4288-Coder(2012 chengdu online)(暴力数组或vector或线段树)
- Building Coder(Revit 二次开发) - 对象关系
- 用Python和Pygame写游戏-从入门到精通(20)
- 牟为松说话算数吗?
- 强烈推荐:240多个jQuery插件
- 二分查找全集
- mysql的group by、order by和having、where比较
- Coder(暴力)
- 黑马程序员————交通灯管理系统(第九篇)
- 失业在家的学习笔记-第二天
- hdu4940 有上下界的无源可行流判断
- 在调用静态库,一直提示undefined reference to 问题解决
- firefox禁用缓存设置
- 获取js某标签下的某类型标签
- android数独游戏机器人
- 浅析fragment