Update content/6_Advanced/Lagrange.mdx

Co-authored-by: Benjamin Qi <bqi343@gmail.com>

Author: A1exL1ang

content/6_Advanced/Lagrange.mdx

@@ -86,7 +86,7 @@ We construct a flow graph with source $S$, sink $T$, and $N+1$ additional vertic
 
 - A bidirectional edge from $i$ ($1 \le i \le N$) to $i+1$ with weight $A[i]$ and capacity $1$.
 
-$f(x)$ will be the maximum cost $x$-flow through the graph. We can repeatidly find the maximum cost augmenting path $x$ times to get our answer. Because the maximum cost as a function of flow is concave, $f(x)$ will be concave. You can read more about simulating cost flows [here](https://codeforces.com/blog/entry/118391).
+$f(x)$ will be the maximum cost $x$-flow through the graph. We can repeatedly find the maximum cost augmenting path $x$ times to get our answer. Because the maximum cost as a function of flow is concave, $f(x)$ will be concave. You can read more about simulating cost flows [here](https://codeforces.com/blog/entry/118391).
 
 </Spoiler>