Submission #439926

#TimeUsernameProblemLanguageResultExecution timeMemory
439926Andrei1998Bubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9046 ms588 KiB
#include "bubblesort2.h" using namespace std; int solve(const vector<int> &A) { const int N = A.size(); vector<int> stk = {0}; int best = 0; for (int i = 1; i < N; ++i) { if (A[i] > A[stk.back()]) { stk.push_back(i); } else if (A[i] < A[stk.back()]) { int st = 1, dr = stk.back() - 1; while (st <= dr) { const int mid = (st + dr) / 2; if (A[i] < A[stk[mid]]) { dr = i - 1; } else { st = i + 1; } } best = max(best, i - (dr + 1)); } } return best; } vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) { int Q = X.size(); vector<int> answer(Q); for (int j = 0; j < Q; j++) { A[X[j]] = V[j]; answer[j] = solve(A); } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...