1104 Sum of Number Segments python

        

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 105. 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.

题意：给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列{0.1, 0.2, 0.3, 0.4}，我们有(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) (0.4) 这10个片段。

给定正整数数列，求出全部片段包含的所有的数之和。如本例中10个片段总和是0.1 + 0.3 + 0.6 + 1.0 + 0.2 + 0.5 + 0.9 + 0.3 + 0.7 + 0.4 = 5.0。
 

此题暴力求解必然会超时的，否则题目显得过于简单了。

寻找规律不难发现，每个数被计算的次数为 i（n-i+1）,i为该数在序列中的位置，从1开始。

但是这道题还考察了精度，网上的答案大部分是c++的，其中可以将数值类型设为longlong就可以通过，double不行，还存在一些部分算法是将数值放大先求和后再缩小，但是目前也是无法AC的。

python自带的浮点数类型只有float，精度是不够的，这里要引入一个模块decimal。

import decimal

n = int(input())
nums = list(map(decimal.Decimal, input().split()))
ans = 0
for i in range(n):
    ans += (nums[i] * (i + 1) * (n - i))
print("%.2f" % ans)