Submission #439938

#	Time	Username	Problem	Language	Result	Execution time	Memory
439938		Andrei1998	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	9025 ms	588 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>

using namespace std;

int solve(const vector<int> &A) {
  const int N = A.size();
  int best = 0;
  vector<int> dp(N, 0);
  for (int i = 1; i < N; ++i) {
    for (int j = 0; j < i; ++j) {
      if (A[i] < A[j]) {
        dp[i] = max(dp[i], 1 + dp[j]);
      }
    }
    best = max(best, dp[i]);
  }
  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;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40