2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1249 Rolling Variance

https://i-blog.csdnimg.cn/blog_migrate/88367cc169c2fef112f3e7579b6a9663.png

Bobo learnt that the variance of a sequence a1,a2,…,an is

∑ni=1(ai−a¯)2n−1−−−−−−−−−−−−√

where

a¯=∑ni=1ain.

Bobo has a sequence a1,a2,…,an , and he would like to find the variance of each consecutive subsequences of length m . Formally, the i -th ( 1≤i≤n−m+1 ) rolling variance ri is the variance of sequence {ai,ai+1,…,ai+m−1} .

Input

The input contains at most 30 sets. For each set:

The first line contains 2 integers n,m (2≤m≤n≤105) .

The second line contains n integers a1,a2,…,an ( |ai|≤100 ).

Output

For each set, (n−m+1) lines with floating numbers r1,r2,…,rn−m+1 .

Your answer will be considered correct if its absolute or relative error does not exceed 10−4 .

Sample Input

3 2
1 3 2
5 3
1 3 2 4 5

Sample Output

1.41421356
0.70710678
1.00000000
1.00000000
1.52752523

(a-b)^2=a^2-2ab+b^2拆开后有

a1^2+a2^2+a3^2+....-2*ave*(a1+a2+a3+.......)+n*ave^2

#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
 
int main()
{
    int n,m;
    double ave;
    int sum[100005],a[100005],pf[100005];
    pf[0]=0;
    while(~scanf("%d %d",&n,&m))
    {
        scanf("%d",&a[1]);
        pf[1]=sum[1]=a[1];
        pf[1]*=pf[1];
        for(int i=2;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];
            pf[i]=pf[i-1]+a[i]*a[i];
        }
        for(int i=m;i<=n;i++)
        {
            ave=1.0*(sum[i]-sum[i-m])/m;
           // printf("%d %d %lf\n",pf[i]-pf[i-m],sum[i]-sum[i-m],m*ave*ave);
            printf("%.8lf\n",sqrt(  (pf[i]-pf[i-m]-2*ave*(sum[i]-sum[i-m] )+m*ave*ave) /(m-1) ));
        }
    }
    return 0;
}