前缀和模板

---

前缀和

牛客网链接：【模板】前缀和

import java.util.Scanner;
 
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt(), q = in.nextInt();
            int[] arr = new int[n + 1];
            for (int i = 1; i <= n; i ++) arr[i] = in.nextInt();
            //创建一个同样大小的前缀和数组，并且因为是多个元素的和，
            //可能会超出int所能表示的最大范围，这里用long来表示
            long[] dp = new long[n + 1];
            for (int i = 1; i <= n; i ++) dp[i] = dp[i - 1] + arr[i];
 
            for (int i = 0; i < q; i ++)
            {
                int l = in.nextInt(), r = in.nextInt();
                System.out.println(dp[r] - dp[l - 1]);
            }
        }
    }
}

差分

牛客网链接：【模板】差分

import java.util.Scanner;
 
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt(), m = in.nextInt();
            int[] arr = new int[n + 1];
            long[] brr = new long[n + 1];
            for (int i = 1; i <= n; i ++)
            {
                arr[i] = in.nextInt();
                brr[i] = arr[i] - arr[i - 1];
            }
 
            for (int i = 0; i < m; i ++)
            {
                int l = in.nextInt(), r = in.nextInt(), k = in.nextInt();
                brr[l] += k;
                if (r >= n) continue;
                brr[r + 1] -= k;
            }
            for (int i = 1; i <= n; i ++)
            {
                brr[i] += brr[i - 1];
                System.out.print(brr[i] + " ");
            }
        }
    }
}

二维前缀和

牛客网链接：【模板】二维前缀和

import java.util.Scanner;
 
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();
            int[][] arr = new int[n + 1][m + 1];
            for (int i = 1; i <= n; i ++)
            {
                for (int j = 1; j <= m; j ++)
                {
                    arr[i][j] = in.nextInt();
                }
            }
 
            long[][] dp = new long[n + 1][m + 1];
            for (int i = 1; i <= n; i ++)
            {
                for (int j = 1; j <= m ; j ++)
                {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + arr[i][j];
                }
            }
 
            for (int i = 0; i < q; i ++)
            {
                int x1 = in.nextInt(), y1 = in.nextInt(), x2 = in.nextInt(), y2 = in.nextInt();
                System.out.println(dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1] + dp[x1 - 1][y1 - 1]);
            }
        }
    }
}

二维差分

牛客网链接：【模板】二维差分

import java.util.Scanner;
 
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
 
    public static int[][] arr;
 
    // public static int insert(int x1, int y1, int x2, int y2)
 
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int m = in.nextInt();
            int q = in.nextInt();
 
            int[][] arr = new int[n + 1][m + 1];
            for (int i = 1; i <= n; i ++)
            {
                for (int j = 1; j <= m; j ++)
                {
                    arr[i][j] = in.nextInt();
 
                }
            }
 
            long[][] dp = new long[n + 2][m + 2];
            for (int i = 1; i <= n; i ++)
            {
                for (int j = 1; j <= m; j ++)
                {
                    dp[i][j] += arr[i][j];
                    dp[i + 1][j] -= arr[i][j];
                    dp[i][j + 1] -= arr[i][j];
                    dp[i + 1][j + 1] += arr[i][j];
                }
            }
 
            for (int i = 0; i < q; i ++)
            {
                int x1 = in.nextInt(), y1 = in.nextInt();
                int x2 = in.nextInt(), y2 = in.nextInt();
                int k = in.nextInt();
 
                dp[x1][y1] += k;
                dp[x2 + 1][y1] -= k;
                dp[x1][y2 + 1] -= k;
                dp[x2 + 1][y2 + 1] += k;
            }
 
            for (int i = 1; i <= n; i ++)
            {
                for (int j = 1; j <= m; j ++)
                {
                    dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
                    System.out.print(dp[i][j] + " ");
                }
                System.out.println();
            }
        }
    }
}