zoj The 12th Zhejiang Provincial Collegiate Programming Contest Beauty of Array

http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5496

The 12th Zhejiang Provincial Collegiate Programming Contest - D

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

分析：

水题、

 AC代码：

 

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
#define ls 2*i
#define rs 2*i+1
#define up(i,x,y) for(i=x;i<=y;i++)
#define down(i,x,y) for(i=x;i>=y;i--)
#define mem(a,x) memset(a,x,sizeof(a))
#define w(a) while(a)
#define LL long long
const double pi = acos(-1.0);
#define Len 1000005
#define mod 786433
#define exp 1e-5
const int INF = 0x3f3f3f3f;

LL dp[Len];
int hsh[Len];

int main()
{
    int t,n,a;
    scanf("%d",&t);
    w(t--)
    {
        memset(hsh,0,sizeof(hsh));
        scanf("%d",&n);
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a);
            dp[i]=dp[i-1]+a+(i-1-hsh[a])*a;
            hsh[a]=i;
        }
        LL ans=0;
        for(int i=1;i<=n;i++)
            ans+=dp[i];
        printf("%lld\n",ans);
    }
}

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <cctype>
#define LL long long
#define INF 0x7fffffff
using namespace std;
long long int dp[100005];
int a[100005];
int main() {
    int t;
    scanf("%d",&t);
    while(t--){
        int n;
                
        scanf("%d",&n);
        map<int,int> num; //num记录前一个a[i]的位置 
        
        for(int i = 0;i < n;i++){
            scanf("%d",&a[i]);
            num[a[i]] = 0;     
        }
        dp[0] = 0;
        dp[1] = a[0];
        num[a[0]] = 1;
        
        for(int i = 1;i < n;i++){
            /*
                dp[i] 为前i个美丽的数组的和
                前i个和包括前i-1个的和 dp[i-1] 还有由第i个数组成的和 dp[i] - dp[i-1] + a[i] * (i+1 - num[a[i]]);
                其中的i+1 - num[a[i]] 是用于去除重复的a[i],重复的只计算一次 
            */ 
            dp[i+1] = dp[i] + dp[i] - dp[i-1] + a[i] * (i+1 - num[a[i]]);
            num[a[i]] = i+1; //将新的位置记录下来 
        }
        cout << dp[n] << endl;
    }
    return 0;
}

 

另外附上本次比赛的终榜：（1-104）