【hihoCoder1384】Genius ACM

最新推荐文章于 2024-07-04 21:24:20 发布

weixin_30919235

最新推荐文章于 2024-07-04 21:24:20 发布

阅读量94

点赞数

原文链接：http://www.cnblogs.com/hlw1/p/11311255.html

版权

题面

分析

显然，这题很容易想到二分，但每次二分一段很大区间，仍然会超时，于是可以考虑倍增。每次可以固定左端点，然后求右端点。

至于求校验值，可以贪心，每次取这段区间内第\(k\)大的和第\(k\)小的即可，但直接sort太慢，考虑merge操作优化。

代码

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define il inline
#define re register
#define maxn 500003
#define tie0 cin.tie(0),cout.tie(0)
#define fastio ios::sync_with_stdio(false)
#define File(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout)
using namespace std;
typedef long long ll;

template <typename T> inline void read(T &x) {
    T f = 1; x = 0; char c;
    for (c = getchar(); !isdigit(c); c = getchar()) if (c == '-') f = -1;
    for ( ; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    x *= f;
}

int n, m, block;
ll t;
ll a[maxn], b[maxn], c[maxn];

void Sort_And_Merge(int l, int r, int last) {
    for (int i = last + 1; i <= r; ++i) b[i] = a[i];
    stable_sort(b + 1 + last, b + 1 + r);
    merge(b + l, b + 1 + last, b + 1 + last, b + 1 + r, c + l);
}

bool check(int l, int r, int last) {
    Sort_And_Merge(l, r, last);
    ll sum = 0;
    for (int i = 1; i <= min(m, (r - l + 1)/2); ++i) {
        sum += (c[l+i-1] - c[r-i+1]) * (c[l+i-1] - c[r-i+1]);
        if (sum > t) return 0;
    }
    if (l == r) sum = 0;
    if (sum <= t) {
        for (int i = l; i <= r; ++i) b[i] = c[i];
        return 1;
    }
    return 0;
}

int main() {
    int k;
    read(k);
    while (k--) {
        block = 0;
        read(n), read(m), read(t);
        for (int i = 1; i <= n; ++i) read(a[i]);
        b[1] = a[1];
        for (int l = 1, r; l <= n; l = r + 1) {
            int p = 1; r = l;
            while (p) {
                if ((r + p <= n) && check(l, r + p, r)) r += p, p <<= 1;
                else p >>= 1;
            }
            block++;
        }
        printf("%d\n", block);
    }
    return 0;
}

转载于:https://www.cnblogs.com/hlw1/p/11311255.html