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 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
找规律的题....先求出每一个东西都要多少个然后就直接相乘就可以了 其中要注意的就是会爆int
要用long long 这是第三个第四个测试点错误的原因
代码
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
typedef long long ll;
double digit[maxn];
ll num[maxn];
int main()
{
ll n ;
scanf("%lld",&n);
for(ll i =1 ; i <= n ; i++)
scanf("%lf",&digit[i]);
//输入
ll m = n,k = n;
for(ll i = 1; i <= n / 2; i++ )
{
num[i] = i * m;
num[k--] = num[i];
m--;
}
if(n % 2 == 1 )
num[n / 2 + 1] = ((n + 1) / 2) * ((n + 1) / 2);
double sum = 0;
for(ll i =1 ; i <=n;i++ )
sum += num[i]*digit[i]*1.0;
printf("%.2lf\n",sum);
return 0;
}