Smaller code for segtree.

1 files changed, 2 insertions, 9 deletions

diff --git a/datastructures/segmentTree.cpp b/datastructures/segmentTree.cpp
index 93a2ceb..cb303d1 100644
--- a/datastructures/segmentTree.cpp
+++ b/datastructures/segmentTree.cpp
@@ -11,11 +11,7 @@ int query(int x, int y, int k = 0, int X = 0, int Y = MAX_N - 1) {
 
 void update(int i, int v, int k = 0, int X = 0, int Y = MAX_N - 1) {
 	if (i < X || Y < i) return;
-	if (X == Y) {
-		m[k] = v;
-		a[i] = v;
-		return;
-	}
+	if (X == Y) { m[k] = v; a[i] = v; return; }
 	int M = (X + Y) / 2;
 	update(i, v, 2 * k + 1, X, M);
 	update(i, v, 2 * k + 2, M + 1, Y);
@@ -24,10 +20,7 @@ void update(int i, int v, int k = 0, int X = 0, int Y = MAX_N - 1) {
 
 // Einmal vor allen anderen Operationen aufrufen.
 void init(int k = 0, int X = 0, int Y = MAX_N - 1) {
-	if (X == Y) {
-		m[k] = a[X];
-		return;
-	}
+	if (X == Y) { m[k] = a[X]; return; }
 	int M = (X + Y) / 2;
 	init(2 * k + 1, X, M);
 	init(2 * k + 2, M + 1, Y);