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<string>
#include<vector>
using namespace std;

int main() {
	//while (1) {	
		int n;
		double x,sum=0;
		cin>>n;
		vector<double> a;//死于没理解题意，用了set
		for(int i=0;i<n;++i){
			cin>>x;
			a.push_back(x);			
		}
		int j=1,all=a.size();
		
		for(int i=0;i<all;++i){
			//cout<<*li<<"  b="<<b[*li]<<"  result="<<(float)b[*li]*(*li)*j*(n-j+1)<<endl;
			sum+=a[i]*j*(n-j+1);			
			//cout<<(*li)*(n-j+1)<<"  SUM="<<sum<<endl;
			++j;
		}
		printf("%.2lf",sum);

	//}
		
}