2019牛客国庆集训派对day6 G Rolling Variance （拆公式 + 前缀和）

题目链接：https://ac.nowcoder.com/acm/contest/1111/G
占坑有空补详解…

code

#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define maxm 5000006
#define ll long long int
#define INF 0x3f3f3f3f
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
#define mem(a) memset(a,0,sizeof(a))
#define sqr(x) (x*x)
#define inf (ll)2e18+1
#define mod 7
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
     while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
     return f*x;
}
int n,m,a[maxn];
ll sum1[maxn],sum2[maxn];
int main()
{
    while(~scanf("%d%d",&n,&m)){
        inc(i,1,n)a[i]=read();
        inc(i,1,n)sum1[i]=sum1[i-1]+a[i],sum2[i]=sum2[i-1]+a[i]*a[i];
        ll sum=sum1[m];
        double p=1.0*sum/m;
        inc(i,1,n-m+1){
            p=1.0*(sum1[i+m-1]-sum1[i-1])/m;
            double tmp=sqrt((1.0*(sum2[i+m-1]-sum2[i-1])-2.0*(sum1[i+m-1]-sum1[i-1])*p+1.0*m*p*p)/(m-1));
            printf("%.8lf\n",tmp);
        }
    }
    return 0;
}