A1104 Sum of Number Segments/B1049 数列的片段和

最新推荐文章于 2022-05-06 16:51:32 发布

Highlight_Jin

最新推荐文章于 2022-05-06 16:51:32 发布

阅读量222

点赞数

分类专栏： # PAT 文章标签：简单数学

本文链接：https://blog.csdn.net/Highlight_Jin/article/details/88930761

版权

PAT 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

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

#include <cstdio>
using namespace std;

int main()
{
	int n;
	scanf("%d", &n);
	double a, ans = 0;
	for(int i=1; i<=n; i++){
		scanf("%lf", &a);
		ans += a * i * (n + 1 - i);  //找规律，如果当前是第i个数，那么其总出现次数等于i*(n+1-i) 
	}	
	printf("%.2f\n", ans);
	return 0;
}