update

OneCodeMonkey · OneCodeMonkey · commit f8172a4f3713 · 2026-05-09T15:03:56.000+08:00
diff --git a/codeForces/Codeforces_2121B_Above_the_Clouds.java b/codeForces/Codeforces_2121B_Above_the_Clouds.java
@@ -0,0 +1,36 @@
+// Time: 327 ms 
+// Memory: 800 KB
+// greedy
+// T:O(sum(ni)), S:O(max(ni))
+// 
+import java.util.HashMap;
+import java.util.Scanner;
+
+public class Codeforces_2121B_Above_the_Clouds {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt();
+            String s = sc.next();
+            HashMap<Character, Integer> record = new HashMap<>();
+            for (int j = 1; j < n - 1; j++) {
+                record.merge(s.charAt(j), 1, Integer::sum);
+            }
+            boolean flag = true;
+            for (char c : record.keySet()) {
+                if (record.get(c) > 1) {
+                    flag = false;
+                    break;
+                }
+            }
+            if (flag) {
+                if (record.containsKey(s.charAt(0)) || record.containsKey(s.charAt(n - 1))) {
+                    flag = false;
+                }
+            }
+
+            System.out.println(flag ? "NO" : "YES");
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2123B_Tournament.java b/codeForces/Codeforces_2123B_Tournament.java
@@ -0,0 +1,26 @@
+// Time: 655 ms 
+// Memory: 1400 KB
+// 可以任意两两比，直至只剩 k 个而 arr[j] 一直不参与。只有一种情况输：k=1 且 arr[j] 不是最大。
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2123B_Tournament {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), j = sc.nextInt(), k = sc.nextInt(), maxVal = -1, indexJ = -1;
+            for (int r = 0; r < n; r++) {
+                int a = sc.nextInt();
+                if (r == j - 1) {
+                    indexJ = a;
+                }
+                maxVal = Math.max(maxVal, a);
+            }
+            boolean ret = k != 1 || maxVal == indexJ;
+
+            System.out.println(ret ? "YES" : "NO");
+        }
+    }
+}
