제출 #821589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821589		Mizo_Compiler	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	332 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 2e5+5;
int n, m, bit[N];

void upd(int i, int v) {
	i++;
	while (i <= n) {
		bit[i] = max(bit[i], v);
		i += (i & (-i));
	}
}

int get(int i) {
	if (i < 0) {
		return 0;
	}
	i++;
	int ret = 0;
	while (i) {
		ret += bit[i];
		i -= (i & (-i));
	}
	return ret;
}

int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	int mx = 0;
	int ls = -1e9;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		int id = i-2;
		if (x - ls <= m)id++;
		int v = get(id);
		mx = max(mx, v);
		upd(i, v);
		ls = x;	
	}
	cout << n-mx;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37