제출 #1160226

#제출 시각아이디문제언어결과실행 시간메모리
1160226siegeonsticksRabbit Carrot (LMIO19_triusis)Java
0 / 100
153 ms18728 KiB
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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...