Java P3372 【模板】线段树 1

题目链接

import java.util.*;
import java.io.*;
public class Main {
	static class Node {
		int l, r;
		long add, sum;
	}
    static int N = 100010;
    
    static Node tr[] = new Node[4 * N];
    static long a[] = new long[N];
    static int n, m;
    
    static void build(int u, int l, int r) {
    	tr[u] = new Node();
    	tr[u].l = l; tr[u].r = r;
    	if(l == r) {
    		tr[u].sum = a[l];
    		return;
    	}
    	int mid = l + r >> 1;
    	build(u << 1, l, mid);
    	build(u << 1 | 1, mid + 1, r);
    	pushup(u);
    }
    
    static void pushup(int u) {
    	tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
    }
    
    static void pushdown(int u) {
    	long add = tr[u].add;
    	if(add != 0) {
    		tr[u << 1].add += add;
    		tr[u << 1].sum += (tr[u << 1].r - tr[u << 1].l + 1) * add;
    		tr[u << 1 | 1].add += add;
    		tr[u << 1 | 1].sum += (tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * add;
    		tr[u].add = 0;
    	}
    }
    
    static void modify(int u, int l, int r, int c) {
    	if(tr[u].l >= l && tr[u].r <= r) {
    		tr[u].add += c;
    		tr[u].sum += (tr[u].r - tr[u].l + 1l) * c;
    		return;
    	}
    	int mid = tr[u].l + tr[u].r >> 1;
    	pushdown(u);
    	if(l <= mid) modify(u << 1, l, r, c);
    	if(r > mid) modify(u << 1 | 1, l, r, c);
    	pushup(u);
    }
    
    static long query(int u, int l, int r) {
    	if(tr[u].l >= l && tr[u].r <= r)
    		return tr[u].sum;
    	long res = 0;
    	int mid = tr[u].l + tr[u].r >> 1;
    	pushdown(u);
    	if(l <= mid) res += query(u << 1, l, r);
    	if(r > mid) res += query(u << 1 | 1, l, r);
    	return res;
    }
    
    public static void main(String[] args) {
        InputReader sc = new InputReader(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        for(int i = 1; i <= n; i ++ )
        	a[i] = sc.nextLong();
        
        build(1, 1, n);
        
        while(m -- > 0) {
        	int k = sc.nextInt();
        	int l = sc.nextInt();
        	int r = sc.nextInt();
        	if(k == 1) {
        		int c = sc.nextInt();
        		modify(1, l, r, c);
        	} else {
        		System.out.println(query(1, l, r));
        	}
        }
    }
    
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}