新人求助，树状数组开$O2$WA2TLE1

求救，代码如下：

#include <bits/stdc++.h>
#define fp(i, l, r) for(register int i = (l); i <= (r); ++i)
#define fd(i, l, r) for(register int i = (l); i >= (r); --i)
#define ANTISYNC ios::sync_with_stdio(false)
#define full(a, b) memset(a, b, sizeof(a))
#define MAXN (int)3e6 + 5
#define lowbit(x) x & (-x)
#define ll long long
#define il inline
using namespace std;

const int INF = 0xfffffff;

int n, k;
int maxn[MAXN], minn[MAXN], num[MAXN];

namespace Fenwick {
    il int add(int x, int y) {
        while(x <= n) {
            maxn[x] = num[x];
            minn[x] = num[x];
            for(register int i = 1; i < lowbit(x); i <<= 1) {
                maxn[x] = max(maxn[x], maxn[x-i]);
                minn[x] = min(minn[x], minn[x-i]);
            }
            x += lowbit(x);
        }
        return 0;
    }

    il int getmax(int l, int r) {
        int ans = -INF;
        while(r >= l) {
            ans = max(ans, num[r]);
            --r;
            for(; r - lowbit(r) >= l; r -= lowbit(r)) {
                ans = max(ans, maxn[r]);
            }
        }
        return ans;
    }

    il int getmin(int l, int r) {
        int ans = INF;
        while(r >= l) {
            ans = min(ans, num[r]);
            --r;
            for(; r - lowbit(r) >= l; r -= lowbit(r)) {
                ans = min(ans, minn[r]);
            }
        }
        return ans;
    }
};

il int init() {
    scanf("%d%d", &n, &k);
    fp(i, 1, n) {
        scanf("%d", &num[i]);
        Fenwick::add(i, num[i]);
    }
    fp(i, 1, n-k+1) {
        printf("%d%c", Fenwick::getmin(i, i+k-1), i == n-k+1 ? '\n' : ' ');
    }
    fp(i, 1, n-k+1) {
        printf("%d%c", Fenwick::getmax(i, i+k-1), i == n-k+1 ? '\n' : ' ');
    }
    return 0;
}

int main() {
    init();
    return 0;
}