# hdu 4267 A Simple Problem with Integers(分类别维护多个树状数组)

738人阅读 评论(0)

Let A1, A2, ... , AN be N elements. Youneed to deal with two kinds of operations. One type of operation is to add agiven number to a few numbers in a given interval. The other is to query thevalue of some element.

Input

There are a lot of test cases.
The first line contains an integer N. (1 <= N <= 50000)
The second line contains N numbers which are the initial values of A1, A2, ..., AN. (-10,000,000 <= the initial value of Ai <= 10,000,000)
The third line contains an integer Q. (1 <= Q <= 50000)
Each of the following Q lines represents an operation.
"1 a b k c" means adding c to each of Ai which satisfies a <= i<= b and (i - a) % k == 0. (1 <= a <= b <= N, 1 <= k <= 10,-1,000 <= c <= 1,000)
"2 a" means querying the value of Aa. (1 <= a <= N)

Output

For each test case, output several lines toanswer all query operations.

const int MAXN = 1000000;
int s[11][11][50005];
int a[50005];
int n;
int lowbit(int x)
{
return x & (-x);
}
int add(int a, int b, int i, int v)
{
while (i <= n)
{
s[a][b][i] += v;
i += lowbit(i);
}
}
int sum(int a, int b, int i)
{
int ret = 0;
while (i > 0)
{
ret += s[a][b][i];
i -= lowbit(i);
}
return ret;
}

int main ()
{
int T;
int op, aa, bb, v, k;
while (RI(n) != EOF)
{
FE(i, 1, n) RI(a[i]);
CLR(s, 0);
int m;
RI(m);
while (m--)
{
RI(op);
if (op == 1)
{
RIV(aa, bb, k, v);
add(k, aa % k, aa, v);
add(k, aa % k, (bb + 1),-v);
}
else
{
RI(aa);
int ans = a[aa];
FE(i, 1, 10) ans += sum(i, aa %i, aa);
cout << ans <<endl;
}
}
}
return 0;
}

0
1

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：112270次
• 积分：2331
• 等级：
• 排名：第16629名
• 原创：121篇
• 转载：4篇
• 译文：0篇
• 评论：13条
评论排行
最新评论