题目链接:hihocode 1116 计算
中文题。
(待解决)还没弄明白为什么PushUp()怎么计算,神奇
#include <stdio.h>
#include <string.h>
#define LL long long
const LL kmod=10007;
const LL maxn=100010;
struct node{
LL l,r;
LL sum,all;
LL ls,rs;
LL mid(){
return (l+r)>>1;
}
};
struct node tree[maxn<<2];
void PushUp(LL rt){
tree[rt].all=(tree[rt<<1].all*tree[rt<<1|1].all)%kmod;
tree[rt].sum=((tree[rt<<1].sum+tree[rt<<1|1].sum)%kmod+(tree[rt<<1].rs*tree[rt<<1|1].ls)%kmod)%kmod;
tree[rt].ls=(tree[rt<<1].ls+(tree[rt<<1].all*tree[rt<<1|1].ls)%kmod)%kmod;
tree[rt].rs=(tree[rt<<1|1].rs+(tree[rt<<1|1].all*tree[rt<<1].rs)%kmod)%kmod;
}
void build(LL l,LL r,LL rt){
tree[rt].l=l;
tree[rt].r=r;
if(l==r){
return ;
}
LL m=tree[rt].mid();
build(l,m,rt<<1);
build(m+1,r,rt<<1|1);
}
void Update(LL p,LL add,LL rt){
if(tree[rt].l==tree[rt].r){
tree[rt].all=tree[rt].sum=add;
tree[rt].rs=tree[rt].ls=add;
return ;
}
LL m=tree[rt].mid();
if(p<=m) Update(p,add,rt<<1);
else Update(p,add,rt<<1|1);
PushUp(rt);
}
int main()
{
LL n,m,u,v;
while(scanf("%lld%lld",&n,&m)!=EOF){
memset(tree,0,sizeof tree);
build(1,n,1);
while(m--){
scanf("%lld%lld",&u,&v);
Update(u,v%kmod,1);
printf("%lld\n",tree[1].sum);
}
}
return 0;
}