Skip to content

Commit 51eebf2

Browse files
Update ys-StaticRangeInversionsQuery.mdx
1 parent ea42290 commit 51eebf2

File tree

1 file changed

+5
-3
lines changed

1 file changed

+5
-3
lines changed

solutions/platinum/ys-StaticRangeInversionsQuery.mdx

+5-3
Original file line numberDiff line numberDiff line change
@@ -23,6 +23,7 @@ using P = pair<int, int>;
2323
const int N = 1e5 + 1;
2424
const int S = 300;
2525

26+
// BeginCodeSnip{BIT (from PURS module)}
2627
template <class T> class BIT {
2728
private:
2829
int size;
@@ -50,6 +51,7 @@ template <class T> class BIT {
5051
return total;
5152
}
5253
};
54+
// EndCodeSnip
5355

5456
struct Query {
5557
int l, r, i;
@@ -80,7 +82,6 @@ int main() {
8082
});
8183

8284
ll res = 0;
83-
8485
BIT<int> bit(n);
8586
// left -> whether we're modifying on the left
8687
auto edit = [&](int id, int x, bool left) {
@@ -92,13 +93,14 @@ int main() {
9293

9394
vector<ll> ans(k);
9495
for (int i = 0; i < q.size(); i++) {
95-
if (i) ans[q[i].i] = res;
96-
if (i + 1 >= q.size()) break;
96+
if (i) { ans[q[i].i] = res; }
97+
if (i + 1 >= q.size()) { break; }
9798
while (q[i].l > q[i + 1].l) { edit(id(--q[i].l), 1, true); }
9899
while (q[i].r < q[i + 1].r) { edit(id(q[i].r++), 1, false); }
99100
while (q[i].l < q[i + 1].l) { edit(id(q[i].l++), -1, true); }
100101
while (q[i].r > q[i + 1].r) { edit(id(--q[i].r), -1, false); }
101102
}
103+
102104
for (int i = 0; i < k; i++) { cout << ans[i] << '\n'; }
103105
}
104106
```

0 commit comments

Comments
 (0)