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) (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.4Sample Output:
5.00
原题链接:
https://www.patest.cn/contests/pat-a-practise/1104
找规律
对于一个长度为n的序列
第1个元素,累加了n*1次;
第2个元素,累加了(n-1)*2次;
。。。
第n个元素,累加了1*n次。
按此规律,边读入边计算即可
CODE:
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
double res=0;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
double t;
scanf("%lf",&t);
res+=(t*(double)(n-i)*(double)(i+1));
}
printf("%.2f",res);
return 0;
}