제출 #126554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126554		E869120	Bubble Sort 2 (JOI18_bubblesort2)	C++14	38 / 100	9086 ms	1848 KiB

bubblesort2

#include "bubblesort2.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N, Q;
pair<int, int> G[1 << 19];

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) {
	N = A.size(); Q = X.size(); vector<int>ans;

	for (int i = 0; i < Q; i++) {
		A[X[i]] = V[i];
		for (int j = 0; j < N; j++) G[j] = make_pair(A[j], j);
		sort(G, G + N);

		int maxn = 0;
		for (int j = 0; j < N; j++) maxn = max(maxn, G[j].second - j);
		ans.push_back(maxn);
	}
	return ans;
}

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