Envío 1461

Código

import java.util.Scanner;

public class Main {

    public void solve(int[] a, int[] s, int p, int q) {
        int sum = s[q];
        if (p - 1 >= 0) {
            sum -= s[p - 1];
        }
        System.out.println(sum);
    }
	public static void main(String[] args) {
        Main solve = new Main();
		Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int [] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int[] s = new int[n];
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += a[i];
            s[i] = sum;
        }

        int c = sc.nextInt();
        int p = 0;
        int q = 0;
        for (int k = 0; k < c; k++) {
            p = sc.nextInt();
            q = sc.nextInt();
            solve.solve(a, s, p, q);
        }
	}
}