原题:1104 Sum of Number Segments (20)
解题思路:
找出每个数的出现次数与其位置的关系即可
代码如下:
#include<cstdio>
const int maxn = 100000 + 5;
double num[maxn];
int main()
{
int n;
while(scanf("%d", &n) == 1)
{
for(int i = 1; i <= n; i++)
scanf("%lf", &num[i]);
double sum = 0;
for(int i = 1; i <= n; i++)
sum += num[i] * (n-i+1) * i;
printf("%.2f\n", sum);
}
return 0;
}