问题 H: candy

问题 H: candy

时间限制: 3 Sec  内存限制: 128 MB
提交: 494  解决: 114
[状态] [讨论版] [提交] [命题人:]
题目描述

Kimi has a lot of candies, and divides them into piles, where the ith pile contains Ai candies. Each time Kimi will choose an interval [l,r], and calculate the total amount of Al,Al+1,…,Ar. It's a hard task, and you're required to solve it.

输入

An integer T(T≤10) will exist in the first line of input, indicating the number of test cases. Each test case begins with the number of piles N(1≤N≤105). The second line contains N integers Ai(1≤Ai≤100), where Ai stands for the number of candies in the ith pile. The next line is the number of queries M(1≤M≤105). The next M lines, each with two integers l,r(1≤lrN), describe the queried intervals.

输出

For each test case, output the total amount of candies in the queried interval.

样例输入 Copy
1
5
1 2 4 5 9
3
1 2
2 4
4 5
样例输出 Copy
3
11
14