제출 #72130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72130		@younha_holic (#118)	박스런 (FXCUP3_box)	C++17	17 / 100	1074 ms	868 KiB

box

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1<<19;
int n, a[maxn], b[maxn];

typedef pair<int, int> pint;
#define x first
#define y second

pint dq[maxn];
int y, z;

void xfill(int s, int e, int l, int r) {
	if (s>e) return;
	int m = (s+e)/2, k = max(m, l);

	y = 0, z = 0;
	for (int i=k-m+1; i<=k; i++) {
		while (y<z and dq[z-1].x < a[i]) z--;
		dq[z++] = pint(a[i], i);
	}
	while (k+1<=r) {
		pint x = dq[y];
		if (a[k+1] > x.x) break;
		k++;
		if (dq[y].y < k-m+1) y++;
		while (y<z and dq[z-1].x < a[k]) z--;
		dq[z++] = pint(a[k], k);
	}
	if (k>r) k = r;
	b[m] = k;

	if (s<e) {
		int m = (s+e)/2;
		xfill(s, m-1, l, k);
		xfill(m+1, e, k, r);
	}
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> n;
	for (int i=1; i<=n; i++) cin >> a[i];

	xfill(1, n, 1, n);

	for (int i=1; i<=n; i++) {
		if (b[i] == n) cout << -1 << ' ';
		else cout << b[i] - i + 1 << ' ';
	}

}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 83