# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946046 | itslq | Jousting tournament (IOI12_tournament) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
int M, X, ans = 0, ansind = 0;
vector<int> remaining;
for (int i = 0; i < N; i++) remaining.push_back(K[i]);
for (int i = 0; i < N; i++) {
X = 0;
vector<int> knights = remaining;
knights.insert(next(knights.begin(), i), R);
for (int j = 0; j < C; j++) {
M = 0;
for (int k = S[j]; k <= E[j]; k++) M = max(M, knights[k]);
knights.erase(next(knights.begin(), S[j]), next(knights.begin(), E[j]));
knights.insert(next(knights.begin(), S[j]), M);
if (M == R) X++;
}
if (X > ans) {
ans = X;
ansind = i;
}
}
return ansind;
}