简单数学题

问题

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 10
5
. 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

思路

暴力破解会超时，扣5分。只能找规律，多写几组数据会发现，每个数字出现的次数为i*(n+1-i)

代码

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    scanf("%d",&n);
    long double temp,ans = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%Lf",&temp);
        ans = ans + temp*i*(n+1-i);
    }
    printf("%.2Lf\n",ans);
    return 0;
}

总结

大坑：float和double都过不了。要用long double
这种题暴力破解可以得15分，但是可以保证在20分钟内做完。如果实在没有找到规律不如先暴力做完，后面有时间再回来做。