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

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

Author: pre-commit-ci[bot]

solutions/gold/cses-1148

@@ -14,9 +14,9 @@ Similarly to [Maximum Building I](https://cses.fi/problemset/task/1147) apply mo
 - $u_{i, j}$ , the last line above $i$ with cell $(x, j)$ such that $r_{x, j} > r_{i, j}$
 - $d_{i, j}$ , the last line under $i$ with cell $(y, j)$ such that $r_{y, j} \ge r_{i, j}$
 
-Using [prefix sums](/silver/more-prefix-sums#2d-prefix-sums) and [difference arrays](https://codeforces.com/blog/entry/78762) 
-we can efficiently update the answer matrix. Having $r_{i,j}$, $u_{i,j}$ and $d_{i,j}$ precomputed, we know the upperbound 
-and the lowerbound of the rectangle of of width $r_{i,j}$ i.e. how much it can expand above and below line $i$ maintaing width $r_{i, j}$. 
+Using [prefix sums](/silver/more-prefix-sums#2d-prefix-sums) and [difference arrays](https://codeforces.com/blog/entry/78762)
+we can efficiently update the answer matrix. Having $r_{i,j}$, $u_{i,j}$ and $d_{i,j}$ precomputed, we know the upperbound
+and the lowerbound of the rectangle of of width $r_{i,j}$ i.e. how much it can expand above and below line $i$ maintaing width $r_{i, j}$.
 We'll do difference arrays on each column independently. Accordingly, the updates of the answer matrix look like this:
 - $ans[1][r_{i,j}]++$
 - $ans[i - u_{i, j} + 2][r_{i,j}]--$ , the upperbound
@@ -39,7 +39,7 @@ Finally, add $ans[i][j]$ to $ans[i][j-1]$ i.e. a submatrix of size $i \times j$
 
 using namespace std;
 
-int main() { 
+int main() {
 	int n, m;
 	cin >> n >> m;
 	vector<vector<int>> r(n + 2, vector<int>(m + 2));
@@ -106,4 +106,4 @@ int main() {
 ```
 
 </CPPSection>
-</LanguageSection>
+</LanguageSection>