没有描述吗哥哥
by linzaizai @ 2024-01-29 18:17:47
@[linzaizai](/user/363866) 看他代码，暴力出奇迹了
```c++
#include<bits/stdc++.h>
using namespace std;
int max(int arr[],int a,int b){
int m = arr[a];
for(int i = a; i < b; i++){
if(m < arr[i]) m = arr[i];
}return m;
}
int main(){
int n,k,t = 0;
cin >> n >> k;
int arr[n];
for(int i = 0; i < n; i++) cin >> arr[i];
for(int i = 0; i < n - k + 1; i++){
if(i != 0 && arr[i + k - 1] <= t && arr[i - 1] != t) cout << t << endl;
else
{
t = max(arr, i, i + k);
cout << t << endl;
}
}
return 0;
}
```
by OldDriverTree @ 2024-01-29 18:20:47
@[Sgx525112](/user/1259672) 不过这题确实可以不用队列啊，可以用 ST 表啊
by OldDriverTree @ 2024-01-29 18:22:00
我 $3$ 年前写的线段树 /cf
by linzaizai @ 2024-01-29 18:24:29
_Every problem can be solved with FFT_
by M1ndeveloped @ 2024-01-29 18:24:54
@[OldDriverTree](/user/681036)
都暂时还没学到呢哈哈，寻思先尝试一下，没想到还真出奇迹了
by Sgx525112 @ 2024-01-29 20:38:46