CF#808 B. Average Sleep Time(水题)
来源:互联网 发布:金字塔软件使用说明书 编辑:程序博客网 时间:2024/06/05 14:27
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more specifically, the average amount of hours of sleep per week). Luckily, Polycarp kept records of sleep times for the last n days. So now he has a sequencea1, a2, ..., an, where ai is the sleep time on the i-th day.
The number of records is so large that Polycarp is unable to calculate the average value by himself. Thus he is asking you to help him with the calculations. To get the average Polycarp is going to consider k consecutive days as a week. So there will be n - k + 1 weeks to take into consideration. For example, if k = 2, n = 3 and a = [3, 4, 7], then the result is .
You should write a program which will calculate average sleep times of Polycarp over all weeks.
The first line contains two integer numbers n and k (1 ≤ k ≤ n ≤ 2·105).
The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 105).
Output average sleeping time over all weeks.
The answer is considered to be correct if its absolute or relative error does not exceed 10 - 6. In particular, it is enough to output real number with at least 6 digits after the decimal point.
3 23 4 7
9.0000000000
1 110
10.0000000000
8 21 2 4 100000 123 456 789 1
28964.2857142857
In the third example there are n - k + 1 = 7 weeks, so the answer is sums of all weeks divided by 7.
#include<bits/stdc++.h>using namespace std;const int N = 2e5 + 10;int n, k;double a[N];int main(){ while(scanf("%d%d", &n, &k) == 2){ a[0] = 0; scanf("%lf", &a[1]); for(int i = 2; i <= n; i++){ scanf("%lf", &a[i]); a[i] += a[i-1]; } double ans = 0; for(int i = 0; i <= n-k; i++){ ans += a[i+k]-a[i]; } printf("%.10f\n", ans/(n-k+1)); }}
- CF#808 B. Average Sleep Time(水题)
- B. Average Sleep Time
- 【codeforces 808】B.Average Sleep Time
- Codeforces 808B Average Sleep Time 题解
- Codeforces 808B Average Sleep Time
- codeforces 808B——Average Sleep Time
- Educational Codeforces Round 21 808B Average Sleep Time
- 【Codeforces 808 B. Average Sleep Time】+ 前缀和
- codeforces——808B——Average Sleep Time
- 【Codeforces 808B】【容斥原理】Average Sleep Time 题解
- Codeforces 808B——Average Sleep Time——思维
- Educational Codeforces Round 21 B. Average Sleep Time
- Educational Codeforces Round 21 B. Average Sleep Time
- codeforces Educational Codeforces Round 21 B. Average Sleep Time
- Educational Codeforces Round 21B. Average Sleep Time
- Educational Codeforces Round 21 B.Average Sleep Time 前缀和,双指针
- CF 327B (水题)
- CF 868 B. Race Against Time【模拟】
- 【剑指offer】旋转数组的最小数字
- 优化UITableViewCell高度计算的那些事
- 远程调用过程JSON数据过大,连接超时
- 创建进程,销毁僵尸进程
- 双边滤波器的原理及实现
- CF#808 B. Average Sleep Time(水题)
- 单点登录系统
- bootstrap-loader使用过程中遇到的几个坑爹问题
- 数据挖掘-C4.5算法
- LSM树(Log-Structured Merge Tree)存储引擎
- UIKit性能调优实战讲解
- vuejs router history 配置到iis
- [采集]网络框架对比分析
- 超大文件分割为小文件便于传输