zoukankan      html  css  js  c++  java
  • 【Codeforces 808B】【容斥原理】Average Sleep Time 题解

    B. Average Sleep Time 
    time limit per test1 second 
    memory limit per test256 megabytes 
    inputstandard input 
    outputstandard output 
    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 sequence a1, 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.

    Input 
    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 
    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.

    Examples 
    input 
    3 2 

    3 4 7 
    output 
    9.0000000000 
    input 
    1 1 
    10 
    output 
    10.0000000000 
    input 
    8 2 
    1 2 4 100000 123 456 789 1 
    output 
    28964.2857142857 
    Note 
    In the third example there are n - k + 1 = 7 weeks, so the answer is sums of all weeks divided by 7.

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <string>
    #include <set>
    #include <queue>
    #include <algorithm>
    #include <vector>
    #include <cstdlib>
    #include <cmath>
    #include <ctime>
    #include <stack>
    #define INF 2100000000
    #define LL long long
    #define clr(x) memset(x, 0, sizeof(x))
    #define ms(a, x) memset(x, a, sizeof(x))
    
    using namespace std;
    
    const int maxn = 2e5+5;
    int n,k;
    double ans,sum,a[maxn];
    
    template <class T> inline void read(T &x) {
        int flag = 1; x = 0;
        char ch = (char)getchar();
        while(ch <  '0' || ch >  '9') { if(ch == '-')  flag = -1; ch = (char)getchar(); }
        while(ch >= '0' && ch <= '9') { x = (x<<1)+(x<<3)+ch-'0'; ch = (char)getchar(); }
        x *= flag;
    }
    
    int main() {
        read(n); read(k);
        for(int i = 1; i <= n; i++){
            scanf("%lf", a+i), sum += a[i];
            if(i >= k) sum -= a[i-k], ans += sum;
        }
        double y = n-k+1;
        printf("%lf
    ",ans/y);
        return 0;
    }
  • 相关阅读:
    Servlet
    javaBean
    堆排序
    快速排序
    JSP9大内置对象
    include指令与<jsp:include>动作标识
    JSP指令标识
    TreeSet
    使用Docker存储之卷Volume
    Java学习之HttpClient的GET与POST请求
  • 原文地址:https://www.cnblogs.com/mavericks/p/7253672.html
Copyright © 2011-2022 走看看