1104 Sum of Number Segments (20分)

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

---

观察找规律：
4个数
            1 2 3 4
出现次数  4 6 6 4
            1 * 4 2 * 3 3 * 2 4 * 1

5个数
            1 2 3 4 5
出现次数  5 8 9 8 5
            1 * 5 2 * 4 3 * 3 4 * 2 5 * 1

6个数
            1   2   3    4     5    6
出现次数  6  10   12  12   10   6
            1 * 6 2 * 5 3 * 4 4 * 3 5 * 2 6 * 1

#include<iostream>

using namespace std;

int main(){
	int n;
	double v, ans = 0;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lf", &v);
		ans += v * i * (n + 1 - i);
	}
	printf("%.2f\n", ans);

	return 0;
}