add aloha/2025maple

storage/aloha/cpp/completed/2025maple-div1-E.cpp

@@ -0,0 +1,40 @@
+#define N 8
+#include <iostream>
+#include <queue>
+#include <utility>
+
+using namespace std;
+using pii = pair<int, int>;
+
+int n = N, arr[N];
+queue<pii> q;
+
+void sweet(int l, int r);
+
+int main() {
+    sweet(0, N-1);
+    for (int e : arr) cout << e << " ";
+    cout << "\n";
+}
+
+void sweet(int l, int r) {
+    q.push({l, r});
+
+    while (!q.empty()) {
+        pii now = q.front(); q.pop();
+
+        int l = now.first, r = now.second;
+        int mid = (l+r)/2;
+
+        if (l > r) continue;
+        arr[mid] = n--;
+
+        if (mid-1 - l > r - (mid+1)) {
+            q.push({l, mid-1});
+            q.push({mid+1, r});
+        } else {
+            q.push({mid+1, r});
+            q.push({l, mid-1});
+        }
+    }
+}

storage/aloha/cpp/completed/2025maple-div1-G.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int n, inv, curr, before;
+    int delta;
+
+    cin >> n >> before;
+
+    bool bflag = false;
+    for (int i = 1; i <= n; i++) {
+        if (bflag) {
+            cout << i - 1 << " " << i << endl;
+        } else {
+            cout << i << " " << i << endl;
+        }
+        cin >> curr;
+        if(curr == 0) {
+            break;
+        }
+        
+        delta = curr - before;
+        if(delta > 0) {
+            bflag = true;
+        } else {
+            bflag = false;
+            before = curr;
+        }
+    }
+
+    return 0;
+}