[原创]ZOJ 3872 Beauty of Array 第12届浙江省省赛D题 [思维] 【数学】

2016-04-19 00:23:29 Tabris_ 阅读数：530

https://blog.csdn.net/qq_33184171/article/details/51184895

Beauty of Array

Time Limit: 2 Seconds Memory Limit: 65536 KB

Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the beauty of all contiguous subarray of the array A.

Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 100000), which indicates the size of the array. The next line contains N positive integers separated by spaces. Every integer is no larger than 1000000.

Output
For each case, print the answer in one line.

Sample Input
3
5
1 2 3 4 5
3
2 3 3
4
2 3 3 2

Sample Output
105
21
38

1 2 3 4 5

1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
_ 2
_ 2 3
_ 2 3 4
_ 2 3 4 5
_ _ 3
_ _ 3 4
_ _ 3 4 5
_ _ _ 4
_ _ _ 4 5
_ _ _ _ 5

1

1 2
_ 2

1 2 3
_ 2 3
_ _ 3

1 2 3 4
_ 2 3 4
_ _ 3 4
_ _ _ 4

1 2 3 4 5
_ 2 3 4 5
_ _ 3 4 5
_ _ _ 4 5
_ _ _ _ 5

1 2 3 4 5
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
_ 2
_ 2 3
_ 2 3 4
_ 2 3 4 5
_ _ 3
_ _ 3 4
_ _ 3 4 5
_ _ _ 4
_ _ _ 4 5
_ _ _ _ 5

1 2 3 4 3
_ 2 3 4 3
_ _ 3 4 3
_ _ _ 4 3
_ _ _ _ 3

1 2 3 4 3
_ 2 3 4 3
_ _ 3 4 3
_ _ _ 4 3
_ _ _ _ 3

1 3 2 4 3
_ 3 2 4 3
_ _ 2 4 3
_ _ _ 4 3
_ _ _ _ 3

3 2 3 4 3
_ 2 3 4 3
_ _ 3 4 3
_ _ _ 4 3
_ _ _ _ 3

ans- = 输入元素 * 未更新的位置；