Skip to content

Commit 6c1cb27

Browse files
Merge pull request #5191 from SociableFish/fix-typo-in-modern-art-3
Update solutions/gold/usaco-1114.mdx
2 parents fd5d78e + d9388c7 commit 6c1cb27

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

solutions/gold/usaco-1114.mdx

+1-1
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ Can you generalize this property to any segment that starts from $a$ to $b$?
2727

2828
Define $\texttt{dp}[i][j]$ as the minimum number of paintings to paint the range
2929
$[i, j]$. Then, one of two things can happen when combining ranges
30-
$[i, j], [j + 1][k]$:
30+
$[i, j], [j + 1, k]$:
3131

3232
1. $A[i] == A[k]$. This means that the range $[i, k]$ has a common color for each
3333
endpoint. Therefore, we can "save" a color when merging the two ranges.

0 commit comments

Comments
 (0)