138 lines
2.8 KiB
C++
138 lines
2.8 KiB
C++
/* Problem URL: https://codeforces.com/contest/2093/problem/E */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int t;
|
|
cin >> t;
|
|
while (t--) {
|
|
int n, k;
|
|
cin >> n >> k;
|
|
|
|
vvi act(n);
|
|
rep(i, n) {
|
|
ll num;
|
|
cin >> num;
|
|
|
|
if (num >= n) {
|
|
continue;
|
|
}
|
|
|
|
act[num].push_back(i);
|
|
}
|
|
|
|
int ans = 0;
|
|
int l = 0;
|
|
int h = n - 1;
|
|
while (l <= h) {
|
|
int mid = (l + h) / 2;
|
|
|
|
set<int> ms;
|
|
int count = 0;
|
|
|
|
int now = -1;
|
|
rep(i, k) {
|
|
int tmp = now;
|
|
bool stop = false;
|
|
for (int j = 0; j <= mid; j++) {
|
|
auto itr = upper_bound(act[j].begin(), act[j].end(), now);
|
|
if (itr == act[j].end()) {
|
|
stop = true;
|
|
break;
|
|
}
|
|
rmax(tmp, *itr);
|
|
}
|
|
|
|
if (stop) {
|
|
break;
|
|
}
|
|
|
|
count++;
|
|
now = tmp;
|
|
}
|
|
|
|
// cout << mid << ' ' << count << '\n';
|
|
if (count >= k) {
|
|
ans = mid + 1;
|
|
l = mid + 1;
|
|
continue;
|
|
}
|
|
|
|
h = mid - 1;
|
|
}
|
|
|
|
cout << ans << '\n';
|
|
}
|
|
}
|