[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

solutions/silver/baltic-12-mobile.mdx

@@ -197,7 +197,9 @@ int main() {
 		}
 
 		// find "crosses"
-		while ((int)stck.size() > 1 && max_point(stck[(int)stck.size() - 2], stck.back()) > max_point(stck.back(), cur)) {
+		while ((int)stck.size() > 1 &&
+		       max_point(stck[(int)stck.size() - 2], stck.back()) >
+		           max_point(stck.back(), cur)) {
 			stck.pop_back();
 		}
 
@@ -209,20 +211,25 @@ int main() {
 		stck.pop_front();
 	}
 
-	while ((int)stck.size() > 1 && max_point(stck[(int)stck.size() - 2], stck.back()) > l) {
+	while ((int)stck.size() > 1 &&
+	       max_point(stck[(int)stck.size() - 2], stck.back()) > l) {
 		stck.pop_back();
 	}
 
 	double ans = 0;
 	for (int x = 0; x < (int)stck.size(); x++) {
-		// get critical points stck[x] is in charge of 
+		// get critical points stck[x] is in charge of
 		Point left = {0, 0};
-		Point right {l, 0};
+		Point right{l, 0};
 
 		if (x) { left.x = max_point(stck[x], stck[x - 1]); }
-		if (x < (int)stck.size() - 1) { right.x = max_point(stck[x], stck[x + 1]); }
-		
-		if (left.x < 0 || right.x > l || right.x < 0 || left.x > l) { continue; }
+		if (x < (int)stck.size() - 1) {
+			right.x = max_point(stck[x], stck[x + 1]);
+		}
+
+		if (left.x < 0 || right.x > l || right.x < 0 || left.x > l) {
+			continue;
+		}
 
 		ans = max({ans, dist(stck[x], left), dist(stck[x], right)});
 	}