编程介的小学生
2017-11-06 03:47Turing Tree
10Problem Description
After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of new problems about intervals. So, today, this sick thing happens again...
Now given a sequence of N numbers A1, A2, ..., AN and a number of Queries(i, j) (1≤i≤j≤N). For each Query(i, j), you are to caculate the sum of distinct values in the subsequence Ai, Ai+1, ..., Aj.
Input
The first line is an integer T (1 ≤ T ≤ 10), indecating the number of testcases below.
For each case, the input format will be like this:
- Line 1: N (1 ≤ N ≤ 30,000).
- Line 2: N integers A1, A2, ..., AN (0 ≤ Ai ≤ 1,000,000,000).
- Line 3: Q (1 ≤ Q ≤ 100,000), the number of Queries.
- Next Q lines: each line contains 2 integers i, j representing a Query (1 ≤ i ≤ j ≤ N).
Output
For each Query, print the sum of distinct values of the specified subsequence in one line.
Sample Input
2
3
1 1 4
2
1 2
2 3
5
1 1 2 1 3
3
1 5
2 4
3 5
Sample Output
1
5
6
3
6
- 点赞
- 回答
- 收藏
- 复制链接分享
0条回答
为你推荐
- println变成go中的空字符串
- arrays
- 1个回答
- 在Golang中执行json解组时为空字段
- json
- struct
- 1个回答
- PHP多维数组(或对象)到JSON
- json
- php
- 4个回答
- 谁能给一个官方的答案
- c++
- 0个回答
- 宏(用户定义的代码转换)的概念是什么时候出现的?
- racket
- macros
- scheme
- lisp
- history
- 3个回答