Stuff

Author: dolphingarlic

.vscode/template.code-snippets

@@ -0,0 +1,33 @@
+{
+	// Place your CompetitiveProgramming workspace snippets here. Each snippet is defined under a snippet name and has a scope, prefix, body and 
+	// description. Add comma separated ids of the languages where the snippet is applicable in the scope field. If scope 
+	// is left empty or omitted, the snippet gets applied to all languages. The prefix is what is 
+	// used to trigger the snippet and the body will be expanded and inserted. Possible variables are: 
+	// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. 
+	// Placeholders with the same ids are connected.
+	// Example:
+	// "Print to console": {
+	// 	"scope": "javascript,typescript",
+	// 	"prefix": "log",
+	// 	"body": [
+	// 		"console.log('$1');",
+	// 		"$2"
+	// 	],
+	// 	"description": "Log output to console"
+	// }
+	"Template": {
+		"scope": "cpp",
+		"prefix": "#include <bits/stdc++.h>",
+		"body": [
+			"#include <bits/stdc++.h>",
+			"typedef long long ll;",
+			"using namespace std;",
+			"",
+			"int main() {",
+			"    cin.tie(0)->sync_with_stdio(0);",
+			"    $0",
+			"    return 0;",
+			"}"
+		]
+	}
+}

CSES/(8) Range Queries/2416.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+typedef long long ll;
+using namespace std;
+
+const ll INF = 1e18;
+
+int n, q;
+ll x[200002], pref[200002], ans[200002];
+ll contrib[200002], bit[200002];
+vector<pair<int, int>> bckt[200001];
+
+void update(int pos, ll val) { for (; pos <= n; pos += pos & -pos) bit[pos] += val; }
+
+ll query(int a, int b) {
+    ll ans = 0;
+    for (; b; b -= b & -b) ans += bit[b];
+    for (a--; a; a -= a & -a) ans -= bit[a];
+    return ans;
+}
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+    cin >> n >> q;
+    for (int i = 1; i <= n; i++) {
+        cin >> x[i];
+        pref[i] = pref[i - 1] + x[i];
+    }
+    x[n + 1] = INF;
+    pref[n + 1] = pref[n] + x[n + 1];
+    for (int i = 1; i <= q; i++) {
+        int a, b;
+        cin >> a >> b;
+        bckt[a].push_back({b, i});
+    }
+    deque<int> stck = {n + 1};
+    for (int i = n; i; i--) {
+        while (stck.size() && x[i] >= x[stck.front()]) {
+            update(stck.front(), -contrib[stck.front()]);
+            stck.pop_front();
+        }
+        contrib[i] = (stck.front() - 1 - i) * x[i] - (pref[stck.front() - 1] - pref[i]);
+        update(i, contrib[i]);
+        stck.push_front(i);
+        for (pair<int, int> j : bckt[i]) {
+            int pos = upper_bound(stck.begin(), stck.end(), j.first) - stck.begin() - 1;
+            ans[j.second] = (pos ? query(i, stck[pos - 1]) : 0) + (j.first - stck[pos]) * x[stck[pos]] - (pref[j.first] - pref[stck[pos]]);
+        }
+    }
+    for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
+    return 0;
+}

IOI/IOI 12-tourist.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+typedef long long ll;
+using namespace std;
+
+struct Node {
+    ll l, r, val;
+    int cnt;
+    Node *lc, *rc;
+
+    Node(ll L, ll R): l(L), r(R), val(0), cnt(0), lc(nullptr), rc(nullptr) {};
+
+    void insert(ll v) {
+        val += v;
+        cnt++;
+        if (l == r) return;
+        ll mid = (l + r) / 2;
+        if (v > mid) {
+            if (!rc) rc = new Node(mid + 1, r);
+            rc->insert(v);
+        } else {
+            if (!lc) lc = new Node(l, mid);
+            lc->insert(v);
+        }
+    }
+
+    ll query(int k) {
+        if (cnt <= k) return val;
+        if (l == r) return (val / cnt) * k;
+        int mid = (l + r) / 2;
+        if (rc && rc->cnt >= k) return rc->query(k);
+        if (!rc) return lc->query(k);
+        return lc->query(k - rc->cnt) + rc->val;
+    }
+};
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+    Node *root = new Node(0, INT_MAX);
+    int n, k;
+    cin >> n >> k;
+    ll ans = 0;
+    for (int i = 0; i < n; i++) {
+        ll v;
+        cin >> v;
+        root->insert(v);
+        ans = max(ans, root->query(k - i));
+    }
+    cout << ans;
+    return 0;
+}