oj.uz

답안 #821591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821591 2023-08-11T11:55:17 Z Mizo_Compiler Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 212 KB 
#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) + 1;
		mx = max(mx, v);
		upd(i, v);
		ls = x;	
	}
	cout << n-mx;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -