Envío 6220

Código

import java.util.HashMap;
import java.util.Objects;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] array = new int[n];
        HashMap<Integer, Integer> sums = new HashMap<>();

        int key1 = 0;
        int total = 0;
        for(int i=0; i<n; i++){
            array[i]=scanner.nextInt();
            total += array[i];
            
            sums.put(Objects.hash(key1, i), total);
        }

        total = 0;
        int key2 = n-1;
        for(int i=n-1; i>=0; i--){
            total+=array[i];
            key1 = i;
            
            sums.put(Objects.hash(key1, key2), total);
        }

        int c = scanner.nextInt();

        int[][] consultas = new int[c][2];
        for(int i=0; i<c; i++){
            int left = scanner.nextInt();
            int right = scanner.nextInt();
            consultas[i][0]=left;
            consultas[i][1]=right;
        }
        
        for(int i=0; i<c; i++){
            int left = consultas[i][0];
            int right = consultas[i][1];
            
            total = sums.get(Objects.hash(0, n-1));
            int sumLeft = left!= 0 ? sums.get(Objects.hash(0, left-1)) : 0;
            int sumRight = right != n-1 ? sums.get(Objects.hash(right+1, n-1)) : 0;

            System.out.println(total - sumLeft - sumRight);
        }
    }
}