C++ PAT甲级 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

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
    int n;
    cin >> n;
    double num[n+1];
    double sum=0;
    /*查找出规律
    (1) (1,2) (1,2,3) (1,2,3,4)(1,2,3,4,5)
    (2) (2,3) (2,3,4) (2,3,4,5)
    (3) (3,4)(3,4,5)
    (4) (4,5)
    (5)
    4=4*1 6=3+3=3*2 6=2+2+2=2*3 4=1*4
    5=5*1 8=4+4=4*2 9=3+3+3=3*3 8=2+2+2+2=2*4 5=1*5
    */
    for(int i=1;i<=n;i++)
    {
        cin >> num[i];
        sum+=num[i]*(n-i+1)*i;
    }
   /* for(int i=0;i<n;i++)
    {
        for(int j=i;j<n;j++)
        {
            sum+=num[j]*(n-j);
        }
    }*/
    cout << setiosflags(ios::fixed) <<setprecision(2)<<sum;
    return 0;
}