Record Breaker

dev-owen · dev-owen · commit 99bfcf8ff207 · 2021-01-01T18:08:16.000+09:00
KS 2020 D-1 / Array Sort / AC / 2021.01.01
diff --git a/README.md b/README.md
@@ -8,6 +8,8 @@ Owen's Algorithm Problem Solving Note
 
 #### Round D
 
+1. Record Breaker / Array Sort / AC / 2021.01.01
+
 #### Round E
 
 #### Round F
diff --git a/src/Kickstart_2020_D_1.java b/src/Kickstart_2020_D_1.java
@@ -1,5 +1,29 @@
+import java.io.*;
+import java.util.*;
+
 public class Kickstart_2020_D_1 {
-	public static void main(String[] args) {
-		System.out.println("Hello World");
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		int T = Integer.parseInt(st.nextToken());
+		for (int i = 1; i <= T; i++) {
+			int N = Integer.parseInt(br.readLine());
+			int[] arr = new int[N];
+			int max = -1;
+			st = new StringTokenizer(br.readLine());
+			int cnt = 0;
+			for (int j = 0; j < N; j++) {
+				arr[j] = Integer.parseInt(st.nextToken());
+			}
+			for (int j = 0; j < N; j++) {
+				if(j == N-1) {
+					if(arr[j] > max) cnt++;
+				} else {
+					if(arr[j] > max && arr[j] > arr[j+1]) cnt++;
+				}
+				max = Math.max(arr[j], max);
+			}
+			System.out.println("Case #" + i + ": " + cnt);
+		}
 	}
 }
