We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents fd5d78e + d9388c7 commit 6c1cb27Copy full SHA for 6c1cb27
solutions/gold/usaco-1114.mdx
@@ -27,7 +27,7 @@ Can you generalize this property to any segment that starts from $a$ to $b$?
27
28
Define $\texttt{dp}[i][j]$ as the minimum number of paintings to paint the range
29
$[i, j]$. Then, one of two things can happen when combining ranges
30
-$[i, j], [j + 1][k]$:
+$[i, j], [j + 1, k]$:
31
32
1. $A[i] == A[k]$. This means that the range $[i, k]$ has a common color for each
33
endpoint. Therefore, we can "save" a color when merging the two ranges.
0 commit comments