oj.uz

Submission #659222

# Submission time Handle Problem Language Result Execution time Memory
659222 2022-11-17T04:29:58 Z dubabuba Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, d, ans = 0;
	cin >> n >> d;

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

	int dp[n+1];
	dp[0] = 0;
	for(int i = 1; i <= n; i++) {
		if(a[i] - a[dp[i-1]] < d) {
			dp[i] = i;
			ans++;
		} else
			dp[i] = dp[i-1];
	}
	
	cout << n - ans << '\n';
	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -