# 甲级1104. Sum of Number Segments (20)

200 ms

65536 kB

16000 B

Standard

CAO, Peng

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) (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.

Sample Input:
4
0.1 0.2 0.3 0.4

Sample Output:
5.00

# 乙级1049. 数列的片段和(20)

200 ms

65536 kB

8000 B

Standard

CAO, Peng

4
0.1 0.2 0.3 0.4


5.00

#### c++代码：

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
double a[n],sum=0.0;
for(int i=0;i<n;++i)
scanf("%lf",&a[i]);
for(int i=0;i<n;++i){
//        下面这一写法是错的，因为n最大为10的5次方，(i+1)*(n-i)可能会超出int的存储范围，造成溢出
//        sum+=(i+1)*(n-i)*a[i];
sum+=(i+1)*a[i]*(n-i);//这一写法是正确的，(i+1)*a[i]会转化成double型，不会造成溢出
}
printf("%.2f",sum);
return 0;
}

• 擅长领域：
• 算法