题解 | #【模板】线段树1#

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static int N = (int)(1e5+10);
    static int n,q;
    static long[] a = new long[N],c = new long[N];

    static int lowbit(int x) {
        return x & -x;
    }

    static void add(int x,long v) {
        for(int i=x;i<=n;i+=lowbit(i)) {
            c[i] += v;
        }
    }

    static long sum(int x) {
        long res = 0;
        for(int i=x;i>0;i-=lowbit(i)) {
            res += c[i];
        }
        return res;
    }

    static void solve() {
        n=in.nextInt(); q = in.nextInt();
        for(int i=1;i<=n;i++) {
            a[i] = in.nextLong();
            add(i,a[i]);
        }
        while(q-->0) {
            int op = in.nextInt();
            if(op==1) {
                int i = in.nextInt(), k = in.nextInt();
                add(i,k);
            }else {
                int l = in.nextInt(), r = in.nextInt();
                out.println(sum(r)-sum(l-1));
            }
        }
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }
 
    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while(st==null||!st.hasMoreElements()) {
                try {
                    str = br.readLine();
                }catch(IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}