1 files changed, 20 insertions, 22 deletions
diff --git a/content/datastructures/monotonicConvexHull.cpp b/content/datastructures/monotonicConvexHull.cpp
index f1721ae..295acc4 100644
--- a/content/datastructures/monotonicConvexHull.cpp
+++ b/content/datastructures/monotonicConvexHull.cpp
@@ -1,27 +1,25 @@
-// Min über Geraden mit MONOTONEN Inserts UND Queries. Jede neue
-// Gerade hat kleineres pair(m, c) als alle vorherigen.
-struct Line {
-	ll m, c;
-	ll operator()(ll x) {return m*x+c;}
-};
+struct Envelope {
+	struct Line {
+		ll m, b;
+		ll operator()(ll x) { return m*x+b; }
+	};
 
-vector<Line> ls;
-ll ptr = 0;
+	vector<Line> ls;
+	int ptr = 0;
 
-bool bad(Line l1, Line l2, Line l3) {
-	return (l3.c-l1.c)*(l1.m-l2.m) < (l2.c-l1.c)*(l1.m-l3.m);
-}
+	static bool bad(Line l1, Line l2, Line l3) {
+		return (l3.b-l1.b)*(l1.m-l2.m) < (l2.b-l1.b)*(l1.m-l3.m);
+	}
 
-void add(ll m, ll c) { // m fallend, Laufzeit O(1) amortisiert
-	while (sz(ls) > 1 && bad(ls.end()[-2], ls.end()[-1], {m, c})) {
-		ls.pop_back();
+	void add(ll m, ll b) {
+		while (ssize(ls) > 1
+		  && bad(ls.end()[-2], ls.back(), {m,b})) ls.pop_back();
+		ls.push_back({m, b});
+		ptr = min(ptr, (int)ssize(ls) - 1);
 	}
-	ls.push_back({m, c});
-	ptr = min(ptr, sz(ls) - 1);
-}
 
-ll query(ll x) { // x >= letztes x, Laufzeit: O(1) amortisiert
-	ptr = min(ptr, sz(ls) - 1);
-	while (ptr + 1 < sz(ls) && ls[ptr + 1](x) < ls[ptr](x)) ptr++;
-	return ls[ptr](x);
-}
-\ No newline at end of file
+	ll query(ll x) {
+		while (ptr < ssize(ls)-1 && ls[ptr+1](x) < ls[ptr](x)) ptr++;
+		return ls[ptr](x);
+	}
+};