即使没学过st表,也能很轻松地学会用st表写这道题。直接上代码。
C o d e Code Code
#include <bits/stdc++.h>
#define int long long
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
using namespace std;
using PII = pair<int, int>;
using i128 = __int128;
const int N = 1e5 + 10;
int n, m;
int f[N][20]; // f[i][k]:原数组中下标从i开始,长度为2^k的区间内元素的最小值
int quary(int l, int r) { // 查询原数组[l, r]范围内的最小值
int len = r - l + 1;
int k = 0;
while ((1 << (k + 1) <= len)) {
k ++;
}
return min(f[l][k], f[r - (1 << k) + 1][k]);
// return min(f[l][k - 1], f[l + (1 << (k - 1))][k - 1]); 不能用这个
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i ++) {
cin >> f[i][0]; // 很容易知道f[i][0] == a[i]
}
// 这里两个循环的顺序不能颠倒
for (int k = 1; k <= 20; k ++) {
for (int i = 1; i <= n; i ++) {
if (i + (1 << k) - 1 <= n) {
f[i][k] = min(f[i][k - 1], f[i + (1 << (k - 1))][k - 1]);
}
}
}
for (int r = m; r <= n; r ++) {
cout << quary(r - m + 1, r) << "\n";
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
// cin >> T; cin.get();
while (T --) solve();
return 0;
}