交叉乘算法

先给出一个整数数组，a1,a2,a3,…,an,然后给你一对整数l，r, (l <= r)，计算i：l->r j: i + 1-> r ai*aj 的值

import java.util.*
// a: int整型一维数组，a1,a2,a3,...,an
// query int整型：一维数组 l1, r1, l2, r2,...lq,rq
// int 整型，一维数组
public class Solution {
   private int mod = 1000000007;
   public int[] getSum(int[] a, int[] query) {
      int len = a.length;
      long[] presum = new long[len+1];
      long[] presumSquare = new long[len+1];
      int[] ans = new int[query.length/2];
      // 求前缀和
      for(int i = 0; i < len; i++) {
         presum[i+1] = (presum[i] + a[i]) % mod;
         presumSquare[i+1] = (presumSquare[i] + (long)a[i]*a[i])%mod;
      }
      // 求结果
      for(int i = 0; i < query.length; i++){
         int l = query[i];
         int r = query[i+1];
         long temp = presum[r] - presum[l-1];
         temp = temp*temp - (presumSquare[r] - presumSquare[l-1]);
         temp /= 2;
         temp %= mod;
         ans[i/2] = temp;
      }
      return ans;
}

参考99乘法表。