update

OneCodeMonkey · OneCodeMonkey · commit 6c28d25df46b · 2025-05-03T13:02:56.000+08:00
diff --git a/codeForces/Codeforces_2019A_Max_Plus_Size.java b/codeForces/Codeforces_2019A_Max_Plus_Size.java
@@ -0,0 +1,42 @@
+// Time: 342 ms 
+// Memory: 1300 KB
+// Greedy.
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2019A_Max_Plus_Size {
+    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(), ret, maxVal = 0;
+            boolean maxValEvenIndex = false;
+            for (int j = 0; j < n; j++) {
+                int a = sc.nextInt();
+                if (a > maxVal) {
+                    maxVal = a;
+                    maxValEvenIndex = false;
+                    if (j % 2 == 0) {
+                        maxValEvenIndex = true;
+                    }
+                } else if (a == maxVal) {
+                    if (j % 2 == 0) {
+                        maxValEvenIndex = true;
+                    }
+                }
+            }
+            if (n % 2 == 0) {
+                ret = n / 2 + maxVal;
+            } else {
+                if (maxValEvenIndex) {
+                    ret = maxVal + n / 2 + 1;
+                } else {
+                    ret = maxVal + n / 2;
+                }
+            }
+
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2043A_Coin_Transformation.java b/codeForces/Codeforces_2043A_Coin_Transformation.java
@@ -0,0 +1,22 @@
+// Time: 359 ms 
+// Memory: 1300 KB
+// brute-force.
+// T:O(sum(logni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2043A_Coin_Transformation {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            long n = sc.nextLong();
+            int ret = 1;
+            while (n >= 4) {
+                n /= 4;
+                ret *= 2;
+            }
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2086A_Cloudberry_Jam.java b/codeForces/Codeforces_2086A_Cloudberry_Jam.java
@@ -0,0 +1,18 @@
+// Time: 359 ms 
+// Memory: 1200 KB
+// .
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2086A_Cloudberry_Jam {
+    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();
+
+            System.out.println(2 * n);
+        }
+    }
+}
diff --git a/leetcode_solved/leetcode_3523_Make_Array_Non_decreasing.java b/leetcode_solved/leetcode_3523_Make_Array_Non_decreasing.java
@@ -0,0 +1,20 @@
+// Runtime 3 ms Beats 64.27% 
+// Memory 72.73 MB Beats 71.33%
+// Greedy & Monotonic.
+// T:O(n), S:O(1)
+// 
+class Solution {
+    public int maximumPossibleSize(int[] nums) {
+        int ret = 0, prev = 0;
+        for (int num : nums) {
+            if (num > prev) {
+                ret++;
+                prev = num;
+            } else if (num == prev) {
+                ret++;
+            }
+        }
+
+        return ret;
+    }
+}
