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
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
Hint
C++ maybe run faster than G++ in this problem.
思路:
单点更新,其次每个节点下都有一棵记录本节点区间中取模的值,然后自下往上合并左右区间取模的值,本题还需离散化,离线操作
#include <cstdio>
#include <algorithm>
#include <cstring>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int maxn=100009;
struct node
{
long long mod[5];//结果必须要是longlong
int cnt;
} tree[maxn<<2];
char cmd[maxn][10];
int a[maxn],add[maxn];
void build(int l,int r,int rt)
{
tree[rt].cnt=0; memset(tree[rt].mod,0,sizeof tree[rt].mod);
if(l==r)
{
return;
}
int m=l+r>>1;
build(lson);
build(rson);
}
void pushup(int rt)
{
tree[rt].cnt=tree[rt<<1].cnt+tree[rt<<1|1].cnt;
for(int i=0; i<5; i++) tree[rt].mod[i]=tree[rt<<1].mod[i];//左子区间可以直接赋值
int lx=tree[rt<<1].cnt;
for(int i=0; i<5; i++)
tree[rt].mod[(lx+i)%5]+=tree[rt<<1|1].mod[i];//合并右子区间
}
void update(int pos,int val,int l,int r,int rt)
{
if(l==r)
{
tree[rt].cnt=val;
tree[rt].mod[1]=val*add[pos];
return;
}
int m=l+r>>1;
if(pos<=m) update(pos,val,lson);
else update(pos,val,rson);
pushup(rt);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int k=0;
for(int i=0; i<n; i++)
{
scanf("%s",cmd[i]);
if(cmd[i][0]!='s')
{
scanf("%d",&a[i]);
if(cmd[i][0]=='a') add[k++]=a[i];
}
}
sort(add,add+k);
k=unique(add,add+k)-add;//离散化去重
build(0,k,1);
for(int i=0; i<n; i++)
{
if(cmd[i][0]=='s')
{
printf("%I64d\n",tree[1].mod[3]);
}
else
{
int pos=lower_bound(add,add+k,a[i])-add;//寻找位置替代二分
if(cmd[i][0]=='a')
update(pos,1,0,k,1);
else update(pos,0,0,k,1);
}
}
}
return 0;
}