【codevs1081】【树状数组】区间修改 单点查询

题目描述 Description

输入描述 Input Description

输出描述 Output Description

样例输入 Sample Input

样例输出 Sample Output

数据范围及提示 Data Size & Hint

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<stack>
#define INF 2100000000
#define ll long long
#define clr(x)  memset(x,0,sizeof(x))
#define clrmax(x)  memset(x,127,sizeof(x))
#define M 100005

using namespace std;

inline int read()
{
char c;
int ret=0,b=0;
while(!(c>='0'&&c<='9'))
{
c=getchar();
if(c=='-')b=1;
}
while(c>='0'&&c<='9')
{
ret=(c-'0')+(ret<<1)+(ret<<3);
c=getchar();
}
if(b)ret=-ret;
return ret;
}

ll tree[M],n;

void add(int a,int x)
{
for(int i=a;i;i-=i&(-i))
tree[i]+=x;
}

ll find(int a)
{
ll ret=0;
for(int i=a;i<=n;i+=i&(-i))
ret+=tree[i];
return ret;
}

int main()
{
freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x=read();
add(i,x);add(i-1,-x);
}
int m;
scanf("%d",&m);
while(m--)
{
int a;
scanf("%d",&a);
if(a==1)
{
int b,c,x;
scanf("%d%d%d",&b,&c,&x);
add(c,x);add(b-1,-x);
}
else
{
int b;
scanf("%d",&b);
printf("%d\n",find(b));
}
}
return 0;
}