1104 Sum of Number Segments-PAT甲级

最新推荐文章于 2023-06-02 14:15:08 发布

原创最新推荐文章于 2023-06-02 14:15:08 发布 · 129 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

pat甲级

本文介绍了一种快速计算序列所有连续子序列（段）中数字总和的方法。通过观察序列{0.1,0.2,0.3,0.4}

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

这道题考的是数学思维，一开始使用dp超时，认真总结下规律，其实只需一层for循环，便可输出结果，对于第i个数而言，其出现的次数即为其本身所在的位置以及其后有的数的个数（包括自身）的乘积

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=100010;
double val[N],sum=0;
int n;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>val[i];
	}
	for(int i=1;i<=n;i++){
		sum+=val[i]*(n-i+1)*i;
	}
	printf("%.2f\n",sum);
	return 0;
}