题目链接:点击打开链接
思路:
由于是一个区间更新问题, 而且更新的值不一样, 所以我们考虑分块。 对于一个块, 我们维护第i块的第一个元素被加了多少了sum[i],第i块被更新了多少次cnt[i], 那么对于一个块内, 元素依次增加sum[i]递减cnt[i], 这是一个等差数列。
细节参见代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <ctime>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
typedef long double ld;
const double eps = 1e-6;
const double PI = acos(-1);
const int mod = 772002 + 233;
const int INF = 0x3f3f3f3f;
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 1e4 + 10;
int T,n,m;
int belong[maxn];
int block;
int num;
int r[maxn], l[maxn];
ll sum[maxn];
ll cnt[maxn];
ll a[maxn];
void build() {
block = sqrt(n);
num = n / block;
if(n % block) num++;
for(int i = 1; i <= num; i++) {
l[i] = (i-1)*block + 1;
r[i] = i * block;
sum[i] = 0;
cnt[i] = 0;
}
r[num] = n;
for(int i = 1; i <= n; i++) belong[i] = (i-1)/block+1;
}
void update(int x, int y, int v) {
if(belong[x] == belong[y]) {
for(int i = x; i <= y; i++) a[i] += v--;
}
else {
for(int i = x; i <= r[belong[x]]; i++) a[i] += v--;
for(int i = belong[x]+1; i < belong[y]; i++) {
sum[i] += v;
cnt[i]++;
v -= block;
}
for(int i = l[belong[y]]; i <= y; i++) a[i] += v--;
}
}
int query(int x) {
ll ans = 0, id = belong[x];
ans = sum[id] - cnt[id]*(x-l[id]);
if(ans < 0) ans = 0;
return (ans + a[x]) % mod;
}
int q;
int main() {
scanf("%d%d", &n, &q);
build();
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
while(q--) {
int id; scanf("%d", &id);
if(id == 1) {
int x, y; scanf("%d%d", &x, &y);
int r = min(x+y-1, n);
update(x, r, y);
}
else {
int x;
scanf("%d", &x);
printf("%d\n", query(x));
}
}
return 0;
}