1104 Sum of Number Segments

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

思路

计算每个数在序列中的出现次数，即以该数为中心点，看其前面和后面有多少中排列组合的情况，以第i个数（从1开始标号）为例，前面可能有0个、1个、…、i - 1个数，一共是i种情况，同理，后面的数有(n - i + 1)种情况，两者相乘即为该数出现次数。

AC代码

#include <cstdio> 
using namespace std;

int main(){
	int n;
	scanf("%d", &n);
	double sum = 0.0, num;
	for(int i = 1; i <= n; i++){
		scanf("%lf", &num);
		sum += num * i * (n + 1 - i);
	}
	printf("%.2lf", sum);
	return 0;
}