1104. Sum of Number Segments (20)

最新推荐文章于 2022-05-09 09:05:15 发布

原创最新推荐文章于 2022-05-09 09:05:15 发布 · 190 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #PAT甲

PAT 甲级专栏收录该内容

97 篇文章

订阅专栏

1104. Sum of Number Segments (20)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CAO, Peng

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

一道比较简单的题，直接上代码吧..

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>

using namespace std;


int main()
{
    //freopen("in.txt","r",stdin);

    vector<double> a;
    a.push_back(-1);
    int N;
    cin>>N;
    for(int i=1;i<=N;i++)
    {
        double t;
        cin>>t;
        a.push_back(t);
    }

    double sum=0;
    for(int i=1;i<=N;i++)
    {
        sum+=a[i]*(N+1-i)*i;
    }
    printf("%.2f",sum);

    return 0;
}