CF 315B(Sereja and Array-峰顶距离统计)

最新推荐文章于 2024-08-23 22:26:47 发布

nike0good

最新推荐文章于 2024-08-23 22:26:47 发布

阅读量1.6k

点赞数

分类专栏：区间

本文链接：https://blog.csdn.net/nike0good/article/details/9052947

版权

区间专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Sereja has got an array, consisting of n integers, a₁, a₂, ..., a_n. Sereja is an active boy, so he is now going to complete m operations. Each operation will have one of the three forms:

Make v_i-th array element equal to x_i. In other words, perform the assignment a_{v_i} = x_i.
Increase each array element by y_i. In other words, perform n assignments a_i = a_i + y_i (1 ≤ i ≤ n).
Take a piece of paper and write out the q_i-th array element. That is, the element a_{q_i}.

Help Sereja, complete all his operations.

Input

The first line contains integers n, m (1 ≤ n, m ≤ 10⁵). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — the original array.

Next m lines describe operations, the i-th line describes the i-th operation. The first number in the i-th line is integer t_i (1 ≤ t_i ≤ 3) that represents the operation type. If t_i = 1, then it is followed by two integers v_i and x_i, (1 ≤ v_i ≤ n, 1 ≤ x_i ≤ 10⁹). If t_i = 2, then it is followed by integer y_i (1 ≤ y_i ≤ 10⁴). And if t_i = 3, then it is followed by integer q_i (1 ≤ q_i ≤ n).

Output

For each third type operation print value a_{q_i}. Print the values in the order, in which the corresponding queries follow in the input.

       Sample test(s) 
     

         input 
       
10 11
1 2 3 4 5 6 7 8 9 10
3 2
3 9
2 10
3 1
3 10
1 1 10
2 10
2 10
3 1
3 10
3 9

         output 
       
2
9
11
20
30
40
39
 
        
 
       

水题，统计与峰顶的距离，模拟

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define MAXM (1000000+10)
int n,m;
/*
struct tree_arr
{
    int a[MAXM*4];
    tree_arr(){memset(a,0,sizeof(a));}
    void inc(int x,int c)
    {
        for(int i=x;i<=n;i+=i&(-i)) a[x]+=c;
    }
    int qur(int x)
    {
        int ans=0;
        for(int i=x;i;i-=i&(-i)) ans+=a[x];
        return ans;
    }
}T1,T2;
void Ins()
{

}*/
int a[MAXM],tmp=0;

int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    cin>>n>>m;
    For(i,n) {scanf("%d",&a[i]);}
    For(i,m)
    {
        int type;
        scanf("%d",&type);
        if (type==1)
        {
            int v,x;
            scanf("%d%d",&v,&x);
            a[v]+=x-(a[v]+tmp);
        }
        else if (type==2)
        {
            int w;
            cin>>w;
            tmp+=w;
        }
        else
        {
            int v;
            scanf("%d",&v);
            cout<<a[v]+tmp<<endl;
        }

    }

	return 0;
}