This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/extc++.h"
using namespace std;
template <typename T>
void dbgh(const T& t) {
cerr << t << endl;
}
template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
cerr << t << " | ";
dbgh(u...);
}
#ifdef DEBUG
#define dbg(...) \
cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr \
if (false) \
cerr
#endif
#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())
int GetBestPosition(int n, int m, int k, int* arr, int* arrl, int* arrr) {
int ans = 0;
for (int i = 0; i < n; i++) {
vector<int> carr(arr, arr + n - 1);
carr.insert(carr.begin() + i, k);
int cans = 0;
for (int i = 0; i < m; i++) {
int l = arrl[i], r = arrr[i];
auto cl = carr.begin() + l;
auto cr = carr.begin() + r + 1;
int w = *max_element(cl, cr);
carr.erase(cl, cr);
carr.insert(carr.begin() + l, w);
cans += w == k;
}
ans = max(ans, cans);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |