Envío 6218

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];
            int key2 = i;

            Key key = new Key(key1, key2);
            sums.put(key.hashCode(), total);
        }

        total = 0;
        int key2 = n-1;
        for(int i=n-1; i>=0; i--){
            total+=array[i];
            key1 = i;

            Key key = new Key(key1, key2);
            sums.put(key.hashCode(), total);
        }

        int c = scanner.nextInt();

        for(int i=0; i<c; i++){
            int left = scanner.nextInt();
            int right = scanner.nextInt();
            total = sums.get(new Key(0, n-1).hashCode());
            int sumLeft = left!= 0 ? sums.get(new Key(0, left-1).hashCode()) : 0;
            int sumRight = right != n-1 ? sums.get(new Key(right+1, n-1).hashCode()) : 0;

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

    private static class Key{
        private int key1;
        private int key2;

        public Key(int key1, int key2) {
            this.key1 = key1;
            this.key2 = key2;
        }

        @Override
        public int hashCode() {
            return Objects.hash(key1, key2);
        }
    }
}