Beauty of Array

最新推荐文章于 2024-05-29 15:55:53 发布

yyxiangyu

最新推荐文章于 2024-05-29 15:55:53 发布

阅读量413

点赞数

CC 4.0 BY-SA版权

分类专栏：省赛选拔

本文链接：https://blog.youkuaiyun.com/yyxiangyu/article/details/70140674

省赛选拔专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个关于数组美的定义及其求解方法。Edward 定义数组的美为数组中所有不同整数的和，并希望通过算法计算出给定数组所有连续子数组美的总和。文章提供了一段 C 语言实现的代码示例，该算法能够有效地解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Beauty of Array

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

Sample Output

105
21
38

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int p[1123456];
long long x[112345];

int main(void)
{
    int t, n;

    scanf("%d", &t);
    while (t--)
    {
        scanf("%d", &n);
        memset(p, 0, sizeof(p));
        for (int i = 1; i <= n; i++)
            scanf("%lld", &x[i]);
        long long sum = 0;
        for (int i = 1; i <= n; i++)
        {
            sum += (n - i + 1) * (i - p[x[i]]) * x[i];
            p[x[i]] = i;
        }
        printf("%lld\n", sum);
    }
    return 0;
}