线段树

 1 #include<bits/stdc++.h>
 2 typedef unsigned long long ll;
 3 using namespace std;
 4 ll s[100503<<2];
 5 ll sum[100503<<2];
 6 int b[100503<<2];
 7 void pushup(int p)
 8 {
 9     sum[p]=(sum[p<<1]+sum[p<<1|1])%mod;
10     b[p]=b[p<<1]&b[p<<1|1];
11 }
12 void build(int p,int l,int r)
13 {
14     if(l==r)
15     {
16         sum[p]=s[l];
17         return ;
18     }
19     int mid=(l+r)>>1;
20     build(p<<1,l,mid);
21     build(p<<1|1,mid+1,r);
22     pushup(p);
23 }
24 ll look(int x,int y,int p,int l,int r)
25 { ll ss=0;
26     if(x<=l&&r<=y)
27     {
28         return sum[p];
29     }
30     int mid=(l+r)>>1;
31     if(x<=mid)ss=(ss+look(x,y,p<<1,l,mid))%mod;
32     if(y>mid) ss=(ss+look(x,y,p<<1|1,mid+1,r))%mod;
33     return ss;
34 }
35 ll kc(ll a,ll b)
36 {
37     ll c=0;
38     while(b)
39     {
40         if(b&1)c=(a+c)%mod;
41         a=(a+a)%mod;
42         b>>=1;
43     }return c;
44 }
45 void add(int x,int y,int p,int l,int r)
46 {   if(b[p]&&x<=l&&r<=y)
47        return ;
48     if(l==r)
49     {
50         ll team=kc(sum[p],sum[p]);
51         if(team==sum[p])b[p]=1;
52         sum[p]=team;
53         return ;
54     }
55     int mid=(l+r)>>1;
56    if(x<=mid) add(x,y,p<<1,l,mid);
57     if(y>mid)add(x,y,p<<1|1,mid+1,r);
58     pushup(p);
59 }
60 ll S;
61 int main()
62 {
63  int t;
64   cin>>t;
65  for(int i=1;i<=t;i++)
66  {S=0;mem(b);mem(s);mem(sum);
67     printf("Case #%d:\n",i);
68      ll n,m;
69      sll(n,m);
70      for(int j=1;j<=n;j++)
71         sl(s[j]);
72      build(1,1,n);
73      while(m--)
74      {
75          int x,y;
76          sii(x,y);
77          S=(S+look(x,y,1,1,n))%mod;
78          printf("%lld\n",S);
79          add(x,y,1,1,n);
80      }
81  }
82 }