【计蒜客】2018ICPC徐州赛区网络赛H Ryuji doesn't want to study【树状数组】

最新推荐文章于 2019-05-07 23:58:29 发布

水果妹妹踩前端的坑

最新推荐文章于 2019-05-07 23:58:29 发布

阅读量170

点赞数

分类专栏：算法文章标签：树状数组

本文链接：https://blog.csdn.net/imagirl1/article/details/82657410

版权

算法专栏收录该内容

35 篇文章 0 订阅

订阅专栏

题目链接

Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i]a[i].

Unfortunately, the longer he learns, the fewer he gets.

That means, if he reads books from lll to rrr, he will get a[l]×L+a[l+1]×(L−1)+⋯+a[r−1]×2+a[r]a[l] \times L + a[l+1] \times (L-1) + \cdots + a[r-1] \times 2 + a[r]a[l]×L+a[l+1]×(L−1)+⋯+a[r−1]×2+a[r] (LLL is the length of [ lll, rrr ] that equals to r−l+1r - l + 1r−l+1).

Now Ryuji has qqq questions, you should answer him:

111. If the question type is 111, you should answer how much knowledge he will get after he reads books [ lll, rrr ].

222. If the question type is 222, Ryuji will change the ith book's knowledge to a new value.

Input

First line contains two integers nnn and qqq (nnn, q≤100000q \le 100000q≤100000).

The next line contains n integers represent a[i](a[i]≤1e9)a[i]( a[i] \le 1e9)a[i](a[i]≤1e9) .

Then in next qqq line each line contains three integers aaa, bbb, ccc, if a=1a = 1a=1, it means question type is 111, and bbb, ccc represents [ lll , rrr ]. if a=2a = 2a=2 , it means question type is 222 , and bbb, ccc means Ryuji changes the bth book' knowledge to ccc

Output

For each question, output one line with one integer represent the answer.

样例输入

样例输出

10
8

题目来源

ACM-ICPC 2018 徐州赛区网络预赛

解题思路：题意很容易理解，就是查和改。将 $\sum_{i=l}^{r}a[i]*(n-i+1)$ 转化成 $\sum_{i=l}^{r}a[i]*(n-i+1)-\sum_{i=l}^{r}a[i]*(n-r)$ ,只需要用树状数组维护a[i]和a[i]*(n-i+1)这两个前缀和就好，因为a[i]*(n-i+1)结果数据范围超过int，所以计算结果时用long long。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll sum[maxn][2];
ll a[maxn];
int lowbit(int i)
{
	return i&(-i);
}
void update(int x,ll c,int op)
{
	while(x<maxn)
	{
		sum[x][op]+=c;
		x+=lowbit(x);
	}
}
ll query(int x,int op)
{
	ll ans=0;
	while(x)
	{
		ans+=sum[x][op];
		x-=lowbit(x);
	}
	return ans;
}
int main(void)
{
        freopen("/Users/ZRP/Desktop/input.txt","r",stdin);
	int n,m,op,l,r;
	scanf("%d%d",&n,&m);
	
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
	{
		update(i,a[i]*(n-i+1),1);
		update(i,a[i],2);
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&op,&l,&r);
		if(op==1)
		{
			printf("%lld\n",query(r,1)-query(l-1,1)-(query(r,2)-query(l-1,2))*(n-r));
		}
		else
		{
			update(l,(r-a[l])*(n-l+1),1);
			update(l,r-a[l],2);
			a[l]=r;
		}
	}
	return 0;
 }