题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4267
题意:一开始给出n个位置的值,接下来的m个操作:
1. a b k x 表示在 a 到 b 里面满足 (i-a)%k == 0 的位置上的值都加 x
2. 询问a点的值
思路:每次更新的都是满足i%k==a%k的位置,因为k<=10,故而考虑所有的取余情况共有55种,对于某个区间可以根据其取余情况去更新某棵线段树
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 50005;
int tr[55][maxn << 2];
int col[maxn << 2];
int a[maxn], pos[15];
void init()
{
pos[0] = 0;
for (int i = 1; i <= 10; i++)
pos[i] = pos[i - 1] + i;
}
void pushdown(int rt)
{
if (col[rt])
{
for (int i = 0; i < 55; i++)
{
tr[i][rt << 1] += tr[i][rt];
tr[i][rt << 1 | 1] += tr[i][rt];
tr[i][rt] = 0;
}
col[rt] = 0;
col[rt << 1] = col[rt << 1 | 1] = 1;
}
}
void build(int l, int r, int rt)
{
col[rt] = 0;
for (int i = 0; i < 55; i++)
tr[i][rt] = 0;
if (l == r) return ;
int m = (l + r) >> 1;
build(lson);
build(rson);
}
void update(int ql, int qr, int k, int c, int l, int r, int rt)
{
if (ql <= l && qr >= r)
{
int cur = ql % k + pos[k - 1];
col[rt] = 1;
tr[cur][rt] += c;
return ;
}
int m = (l + r) >> 1;
if (ql <= m)
update(ql, qr, k, c, lson);
if (qr > m)
update(ql, qr, k, c, rson);
}
int query(int k, int l, int r, int rt)
{
if (l == r)
{
int res = 0;
for (int i = 1; i <= 10; i++)
{
int cur = k % i + pos[i - 1];
res += tr[cur][rt];
}
return res;
}
pushdown(rt);
int m = (l + r) >> 1;
if (m >= k)
return query(k, lson);
else
return query(k, rson);
}
int main()
{
init();
int n;
while (~scanf("%d", &n))
{
build(1, n, 1);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int q;
scanf("%d", &q);
while (q--)
{
int op;
scanf("%d", &op);
if (op == 1)
{
int a, b, k, c;
scanf("%d%d%d%d", &a, &b, &k, &c);
update(a, b, k, c, 1, n, 1);
}
else
{
int k;
scanf("%d", &k);
int ans = a[k];
ans += query(k, 1, n, 1);
printf("%d\n", ans);
}
}
}
return 0;
}