【PAT】1104 Sum of Number Segments【排列组合】

昵称五个字

于 2019-07-12 10:38:02 发布

阅读量596

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/95596352

版权

该博客介绍了PAT编程竞赛中的一道题目，要求计算给定正数序列的所有连续子序列的和。博客提供了输入输出规格，并给出一个4个元素序列的示例。博主解析了题意，指出解决思路是找到包含每个元素的子序列数量的规律，并给出了避免整型溢出的编程技巧。最后，博主分享了实现代码。

摘要由CSDN通过智能技术生成

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.