1.游戏 - 蓝桥云课 (lanqiao.cn)https://www.lanqiao.cn/problems/6251/learning/?page=1&first_category_id=1&difficulty=20&tags=2023,%E5%9B%BD%E8%B5%9B使用单调队列求出每个区间的最大值和最小值,然后依据题意找规律即可
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+10;
int a[N];
int f[N];
LL sum_p=0,sum_q=0;
int main()
{
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
int hh=-1,rr=0;
for(int i=0;i<n;i++)
{
if(rr<=hh&&f[rr]<=i-k)
rr++;
while(rr<=hh&&a[f[hh]]>=a[i])
hh--;
f[++hh]=i;
if(i>=k-1)
sum_q+=a[f[rr]];
}
hh=-1,rr=0;
for(int i=0;i<n;i++)
{
if(rr<=hh&&f[rr]<=i-k)
rr++;
while(rr<=hh&&a[f[hh]]<=a[i])
hh--;
f[++hh]=i;
if(i>=k-1)
sum_p+=a[f[rr]];
}
double sum;
sum=(double)(sum_p-sum_q)/(n-k+1);
printf("%.2lf",sum);
return 0;
}