From d9388c7f48ba4c1ad90a580df6cb1f46a628e60e Mon Sep 17 00:00:00 2001
From: SociableFish <90531624+SociableFish@users.noreply.github.com>
Date: Tue, 11 Mar 2025 01:11:16 +0000
Subject: [PATCH] Update solutions/gold/usaco-1114.mdx

---
 solutions/gold/usaco-1114.mdx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/solutions/gold/usaco-1114.mdx b/solutions/gold/usaco-1114.mdx
index b2e878f80f..3175e84269 100644
--- a/solutions/gold/usaco-1114.mdx
+++ b/solutions/gold/usaco-1114.mdx
@@ -27,7 +27,7 @@ Can you generalize this property to any segment that starts from $a$ to $b$?
 
 Define $\texttt{dp}[i][j]$ as the minimum number of paintings to paint the range
 $[i, j]$. Then, one of two things can happen when combining ranges
-$[i, j], [j + 1][k]$:
+$[i, j], [j + 1, k]$:
 
 1. $A[i] == A[k]$. This means that the range $[i, k]$ has a common color for each
    endpoint. Therefore, we can "save" a color when merging the two ranges.