1104 Sum of Number Segments (20分)【找规律】

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

 解题思路：

如果对于题目没有很明确的思路时，我们可以先举几个简单的例子，来找规律：

第i个数	1	2	3	4
总出现次数	4	6	6	4

 

第i个数	1	2	3	4	5
总出现次数	5	8	9	8	5

 

第i个数	1	2	3	4	5	6
总出现次数	6	10	12	12	10	6

 

我们可以发现以上的规律为，第i个数的总出现次数：i*(n+1-i)

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
	int n;
	double num, sum = 0;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> num;
		sum += num*i*(n + 1 - i);
	}
	printf("%.2f\n", sum);
	return 0;
}