题目链接
S-T模板题
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=100010;
const int LogN=20;
int n,k,log[N],f[N][LogN],z[N][LogN],a[N];
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
log[0]=-1; //初始化
for(int i=1;i<=n;i++){
f[i][0]=z[i][0]=a[i],log[i]=log[i>>1]+1;
}
for(int j=1;j<=LogN;j++){
for(int i=1;i+(1<<j)-1<=n;i++){
f[i][j]=max(f[i][j-1],f[i+(1<<j-1)][j-1]); //最大
z[i][j]=min(z[i][j-1],z[i+(1<<j-1)][j-1]); //最小
}
} //S-T算法
for(int i=1;i+k-1<=n;i++){
int x=i,y=i+k-1;
int s=log[y-x+1];
printf("%d %d\n",max(f[x][s],f[y-(1<<s)+1][s]),min(z[x][s],z[y-(1<<s)+1][s]));
}
return 0;
}