CSUMQ  Cumulative Sum Query
William Macfarlane wants to look at an array.
You are given a list of N numbers and Q queries. Each query is specified by two numbers i and j; the answer to each query is the sum of every number between the range [i, j] (inclusive).
Note: the query ranges are specified using 0based indexing.
Input
The first line contains N, the number of integers in our list (N <= 100,000). The next line holds N numbers that are guaranteed to fit inside an integer. Following the list is a number Q (Q <= 10,000). The next Q lines each contain two numbers i and j which specify a query you must answer (0 <= i, j <= N1).
Output
For each query, output the answer to that query on its own line in the order the queries were made.
Example
Input: 3
1 4 1
3
1 1
1 2
0 2
Output: 4
5
6
hide comments
karthikn_2099:
20190802 14:54:35
even brute force approach is getting accepted


veerendrasd_9:
20190525 07:47:22
Use segment trees, for any range queries.


tanu_1603070:
20180519 07:42:28
Dataset is very weak :/

Added by:  Joshua Kirstein 
Date:  20141027 
Time limit:  7s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Hi Mom! 