weekly contest

Author: A-stick-bug

3522. Calculate Score After Performing Instructions.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+class Solution {
+public:
+    long long calculateScore(vector<string>& instructions, vector<int>& values) {
+        int n = values.size();
+        vector<bool> vis(n);
+        long long score = 0;
+        int idx = 0;
+        while (0 <= idx and idx < n and not vis[idx]) {
+            vis[idx] = true;
+            if (instructions[idx] == "add") {
+                score += values[idx];
+                idx++;
+            }
+            else {
+                idx += values[idx];
+            }
+        }
+        return score;
+    }
+};
+
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+
+
+    return 0;
+}

3523. Make Array Non-decreasing.cpp

@@ -0,0 +1,37 @@
+// https://leetcode.com/problems/make-array-non-decreasing
+// Observation based question, simplifies to prefix max
+//
+// Login behind code:
+// - start with the first number and loop to the right
+// - for any number smaller than it, we must combine it with the first one to keep it non-decreasing
+// - for any number >= cur, we can now treat it as the new start and repeat
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+class Solution {
+public:
+    int maximumPossibleSize(vector<int>& nums) {
+        int total = 0;
+        int pref_max = 0;
+        for (int num: nums) {
+            if (num >= pref_max) {
+                pref_max = num;
+                total++;
+            }
+        }
+        return total;
+    }
+};
+
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+
+
+    return 0;
+}