PAT (Advanced Level) Practice 1104 Sum of Number Segments （20 分）-CSDN博客

博客给出一个关于序列分段求和的题目，给定正整数序列，需找出所有分段数字之和。说明了输入规格，包括序列大小及元素范围，输出要求精确到小数点后两位。最后提及题解，但未给出具体内容。

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

题目详情

Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segments: (0.1) (0.1, 0.2) (0.1, 0.2, 0.3) (0.1, 0.2, 0.3, 0.4) (0.2) (0.2, 0.3) (0.2, 0.3, 0.4) (0.3) (0.3, 0.4) and (0.4).

Now given a sequence, you are supposed to find the sum of all the numbers in all the segments. For the previous example, the sum of all the 10 segments is 0.1 + 0.3 + 0.6 + 1.0 + 0.2 + 0.5 + 0.9 + 0.3 + 0.7 + 0.4 = 5.0.

Input Specification:

Each input file contains one test case. For each case, the first line gives ==a positive integer $N$ , the size of the sequence which is no more than $10^5$ . The next line contains $N$ positive numbers in the sequence, each no more than 1.0, separated by a space.

Output Specification:

For each test case, print in one line the sum of all the numbers in all the segments, accurate up to 2 decimal places.

Sample Input:

4
0.1 0.2 0.3 0.4

Sample Output:

5.00

Thanks to Ruihan Zheng for correcting the test data.

题解

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>

int main() {
    int n;
    double v, ans = 0;
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i) {
        scanf("%lf", &v);  // 第 i 位的值为 v
        ans += v * i * (n + 1 - i);  // 第 i 位的总出现次数为 v * i * (n + 1 - i)
    }

    printf("%.2f\n", ans);
}