import java.io.*;
import java.util.*;
public class triusis {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] h = new int[n];
for (int i=0; i<n; i++) h[i] = sc.nextInt();
System.out.println(solve(h, m));
}
private static int solve(int[] h, int m) {
int n = h.length, mods = 0, currh = 0;
for (int i=0; i<n; i++) {
if (h[i]>currh+m) {
mods++;
currh+=m;
} else currh = h[i];
}
return mods;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |