LOJ#6280. 数列分块入门 4
另外开一个数组维护每一个块内的总和。
给区间加值是,残余的块一个一个点更新,整个的块一次性更新
查询的时候也是,残余的块一个一个点加,整个的块一次性加
#include<map> #include<set> #include<ctime> #include<cmath> #include<stack> #include<queue> #include<string> #include<vector> #include<cstdio> #include<cstdlib> #include<cstring> #include<iostream> #include<algorithm> #define first fi #define second se #define lowbit(x) (x & (-x)) typedef unsigned long long int ull; typedef long long int ll; const double pi = 4.0*atan(1.0); const int inf = 0x3f3f3f3f; const int maxn = 50005; const int maxm = 100000; const int mod = 998244353; using namespace std; int n, m, tol, T; int block; ll a[maxn]; ll b[maxn]; ll add[maxn]; int belong[maxn]; void init() { memset(a, 0, sizeof a); memset(b, 0, sizeof b); memset(add, 0, sizeof add); memset(belong, 0, sizeof belong); } int L(int x) { return (x-1)*block+1; } int R(int x) { return min(n, x*block); } void update(int l, int r, int c) { for(int i=l; i<=min(r, R(belong[l])); i++) { a[i] += c; b[belong[i]] += c; } if(belong[l] == belong[r]) return ; if(belong[l] != belong[r]) { for(int i=L(belong[r]); i<=r; i++) { a[i] += c; b[belong[i]] += c; } } for(int i=belong[l]+1; i<belong[r]; i++) { add[i] += c; b[i] += c * (R(i) - L(i) + 1); } } ll query(int l, int r, int c) { ll ans = 0; for(int i=l; i<=min(r, R(belong[l])); i++) { ans += a[i] + add[belong[i]]; ans %= c; } if(belong[l] == belong[r]) return ans; if(belong[l] != belong[r]) { for(int i=L(belong[r]); i<=r; i++) { ans += a[i] + add[belong[i]]; ans %= c; } } for(int i=belong[l]+1; i<belong[r]; i++) { ans += b[i]; ans %= c; } return ans % c; } int main() { while(~scanf("%d", &n)) { init(); block = sqrt(n); for(int i=1; i<=n; i++) { scanf("%lld", &a[i]); belong[i] = (i-1) / block + 1; b[belong[i]] += a[i]; } m = n; while(m--) { int op, l, r, c; scanf("%d%d%d%d", &op, &l, &r, &c); if(op == 0) { update(l, r, c); } else { ll ans = query(l, r, c+1); printf("%lld\n", ans); } } } return 0; }