//https://codeforces.com/problemset/problem/1630/B
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int n, k, a[N], pre[N];
/*
题意:将一个长度为n的数组a划分为k段,使得每一段中数值大小属于[x, y]的数的数量大于不属于
此区间的数的数量,询问y - x的最小值
思路:枚举x,二分y
check :若在区间中的数有cnt1个,不在区间中的数有cnt0个,那么最多可以
划分出 K = (cnt1 - cnt0)个符合条件的子段(K <= 0表示无解),则K >= k则符合题意
因为一个数只会对K加一或者减一,K的变化是连续的,则整个数组一定可以划分为K个
段,每段各自的K值都为一
*/
int check(int l, int r)
{
return 2 * (pre[r] - pre[l - 1]) - n >= k;
}
void solve()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
pre[i] = 0;
for (int i = 1; i <= n; i++)
pre[a[i]]++;
for (int i = 1; i <= n; i++)
pre[i] += pre[i - 1];
pair<int, int> ans = {-inf, inf};
for (int L = 1; L <= n; L++)
{
int l = L, r = n, R = 0;
while (l <= r)
{
int mid = (l + r) / 2;
if (check(L, mid))
{
R = mid;
r = mid - 1;
}
else
l = mid + 1;
}
if (R && R - L < ans.second - ans.first)
ans = { L, R };
}
cout << ans.first << ' ' << ans.second << '\n';
int num = 1, cnt0 = 0, cnt1 = 0;
for (int l = 1, r = 1; r <= n; r++)
{
if (a[r] >= ans.first && a[r] <= ans.second)
cnt1++;
else
cnt0++;
if (num == k)
{
cout << l << ' ' << n << '\n';
return;
}
if (cnt1 - cnt0 >= num)
{
cout << l << ' ' << r << '\n';
l = r + 1;
num++;
}
}
}
signed main()
{
IOS;
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
B. Range and Partition (二分, 划分子段)
最新推荐文章于 2024-09-11 11:31:11 发布