From fd1f2b36e95c03625297b7b8cba3b1a04a0cc0ed Mon Sep 17 00:00:00 2001
From: mzuenni <michi.zuendorf@gmail.com>
Date: Tue, 10 Jan 2023 11:40:09 +0100
Subject: change whitespaces

---
 datastructures/sparseTable.cpp | 38 +++++++++++++++++++-------------------
 1 file changed, 19 insertions(+), 19 deletions(-)

(limited to 'datastructures/sparseTable.cpp')

diff --git a/datastructures/sparseTable.cpp b/datastructures/sparseTable.cpp
index 3d11119..40057bd 100644
--- a/datastructures/sparseTable.cpp
+++ b/datastructures/sparseTable.cpp
@@ -1,24 +1,24 @@
 struct SparseTable {
-  vector<vector<int>> st;
-  vector<ll> *a;
+	vector<vector<int>> st;
+	vector<ll> *a;
 
-  bool better(int lidx, int ridx) {
-    return a->at(lidx) <= a->at(ridx);
-  }
+	bool better(int lidx, int ridx) {
+		return a->at(lidx) <= a->at(ridx);
+	}
 
-  void init(vector<ll> *vec) {
-    a = vec;
-    st.assign(__lg(sz(*a)) + 1, vector<int>(sz(*a)));
-    for (int i = 0; i < sz(*a); i++) st[0][i] = i;
-    for (int j = 0; (2 << j) <= sz(*a); j++) {
-      for (int i = 0; i + (2 << j) <= sz(*a); i++) {
-        st[j + 1][i] = better(st[j][i] , st[j][i + (1 << j)])
-                            ? st[j][i] : st[j][i + (1 << j)];
-  }}}
+	void init(vector<ll> *vec) {
+		a = vec;
+		st.assign(__lg(sz(*a)) + 1, vector<int>(sz(*a)));
+		for (int i = 0; i < sz(*a); i++) st[0][i] = i;
+		for (int j = 0; (2 << j) <= sz(*a); j++) {
+			for (int i = 0; i + (2 << j) <= sz(*a); i++) {
+				st[j + 1][i] = better(st[j][i] , st[j][i + (1 << j)])
+				                    ? st[j][i] : st[j][i + (1 << j)];
+	}}}
 
-  int queryIdempotent(int l, int r) {
-    int j = __lg(r - l); //31 - __builtin_clz(r - l);
-    return better(st[j][l] , st[j][r - (1 << j)])
-                ? st[j][l] : st[j][r - (1 << j)];
-  }
+	int queryIdempotent(int l, int r) {
+		int j = __lg(r - l); //31 - builtin_clz(r - l);
+		return better(st[j][l] , st[j][r - (1 << j)])
+		            ? st[j][l] : st[j][r - (1 << j)];
+	}
 };
\ No newline at end of file
-- 
cgit v1.2.3