分数 20
全屏浏览题目
切换布局
作者 CAO, Peng
单位 Google
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
Thanks to Ruihan Zheng for correcting the test data.
代码长度限制
16 KB
时间限制
200 ms
内存限制
64 MB
思路:记录每个数字要计算的次数,即位置i的区间左端点的个数*区间右端点的个数i*(n-i+1),相乘即为位置i的数字需要计算的个数
#include<bits/stdc++.h>
using namespace std;
int n;
long double sum;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
double t;
cin>>t;
sum+=t*i*(n-i+1);//这里t要放前面,因为10^5*10^5超过int范围,溢出(或者直接定义long long int就不用考虑这么多)
}
printf("%.2Lf\n",sum);
return 0;
}