【社区高校算法学习社区蓝桥刷题帖子详情第十四届蓝桥杯三月真题刷题训练——第 27 天（3.30） & 储物点的距离 & 数学考试 & 地标访问 & 木材】-CSDN博客

本文链接：https://blog.csdn.net/m0_52201500/article/details/129866647

第一题：储物点的距离

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

public class Main {
    public static long mod = 1000000007;
    public static int n, m;
    public static long[] a, b, sums, A;
    public static long f(int x, int l, int r) {
        return (a[x] * (sums[r] - sums[l - 1] + mod) % mod) % mod; 
    }
	public static void main(String[] args) {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
        n = in.nextInt();
        m = in.nextInt();
        a = new long[n + 10];
        b = new long[n + 10];
        sums = new long[n + 10];
        A = new long[n + 10];
        for(int i = 2; i <= n; ++i) a[i] = (in.nextLong() + a[i - 1]) % mod;
        for(int i = 1; i <= n; ++i) {
            b[i] = in.nextLong();
            sums[i] = (b[i] + sums[i - 1]) % mod;
        }
        for(int i = 1; i <= n; ++i) {
            A[i] = (A[i - 1] + (a[i] * b[i]) % mod) % mod;
        }
        for(int i = 0; i < m; ++i) {
            int x = in.nextInt(), l = in.nextInt(), r = in.nextInt();
            if(x >= r) out.println((f(x, l, r) - ((A[r] - A[l - 1] + mod) % mod) + mod) % mod);
            else if(x <= l) out.println((((A[r] - A[l - 1] + mod) % mod) - f(x, l, r) + mod) % mod);
            else out.println((((f(x, l, x - 1) - ((A[x - 1] - A[l - 1] + mod) % mod) + mod) % mod) 
                              + ((((A[r] - A[x - 1] + mod) % mod) - f(x, x, r) + mod) % mod)) % mod);
        }
		out.close();
	}
}
class InputReader{BufferedReader buf;StringTokenizer tok;InputReader(){buf = new BufferedReader(new InputStreamReader(System.in));}boolean hasNext(){while (tok == null || !tok.hasMoreElements()){try{tok = new StringTokenizer(buf.readLine());}catch (Exception e){return false;}}return true;}String next(){if (hasNext())
			return tok.nextToken();return null;}int nextInt(){return Integer.parseInt(next());}long nextLong(){return Long.parseLong(next());}double nextDouble(){return Double.parseDouble(next());}BigInteger nextBigInteger(){return new BigInteger(next());}BigDecimal nextBigDecimal(){return new BigDecimal(next());}}