代码重点为第30行到第39行。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 500005;

int a[maxn], b[maxn], c[maxn], a2[maxn];

int Yuanshen(int l, int r, int m) {
    for (int i = l; i <= r; i++) a2[i] = a[i];
    sort(a2+l+1, a2+1+r);
    int cnt1 = 0, cnt2 = 0, ans = 0;
    for (int i = l; i <= min(m, (l+r)/2); i++) b[++cnt1] = a2[i];
    for (int i = r; i >= max(r - m + 1, r - (l + r) / 2 + 1); i--) c[++cnt2] = a2[i];
    for (int i = 1; i <= cnt1; i++) ans += (a2[i] - b[i]) * (a2[i] - b[i]);
    return ans;
}

int main() {
    int K, n, m, T;
    cin >> K; 
    while (K--) {
        cin >> n >> m >> T;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        int L = 0, ans = 0;
        while (L != n) {
            int p = 1, R = L;
            //cout << L << "!\n";
            while (p) {
                cout << p << '\n';
                int v = Yuanshen(L, R + p, m);
                //cout << p/2 << " "<< v << " " << T << "?\n";
                if (v <= T) {
                    R += p;
                    p *= 2;
                } else p /= 2;
                cout << p << " !!";
            }
            L = R;
            ans ++;
        }
        cout << ans << "\n";
    }
}

输入

2
5 1 49
8 2 1 7 9
5 1 64
8 2 1 7 9

放在洛谷IDE输出

1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
0 !!1
...

死循环了，为什么“!!”前后不一样，p的值我也没改呀qwq