zoj3872Beauty of Array
来源:互联网 发布:最贵域名排行 编辑:程序博客网 时间:2024/06/04 01:33
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
351 2 3 4 532 3 342 3 3 2
Sample Output
1052138
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<list>#include<queue>#include<vector>using namespace std;const int maxn=1000010;long long pos[maxn];int main(){long long t,n,i,j,k,ans;scanf("%lld",&t);while(t--){scanf("%lld",&n);ans=0;memset(pos,0,sizeof(pos));for(i=1;i<=n;++i){scanf("%lld",&k);ans=ans+k*(n-i+1)*(i-pos[k]);pos[k]=i; }printf("%lld\n",ans);}return 0;}
0 0
- zoj3872Beauty of Array
- array of const
- Object & Array of JavaScript
- Size of an array
- array of const
- Sort array of strings
- array of LinkedList
- ZOJ3872 Beauty Of Array
- Array of Leetcode: EASY
- 88-Product of Array
- Balanced Partition of Array
- get product of array
- Beauty of Array
- LeetCode_697_Degree of an Array
- Array of Data Structure
- Why the address of array equals array.
- Open array parameters and array of const
- max sub array of the given array
- Java语言基础新手熟知
- linux常用命令-part3
- 对一个正整数n,算得到1需要的最少操作次数
- python线程池(threadpool)模块使用
- animation中的transform
- zoj3872Beauty of Array
- POJ-3071 Football (概率DP)
- python-模拟math.pi
- leetcode:25. Reverse Nodes in k-Group
- linux常用命令-part1
- case when 将表中一列按照一定规则分两列显示
- linux常用命令-part2
- 搜索水题 (排列组合)
- Ubuntu16.04 VirtualBox的卸载和升级