Update usaco-104.mdx

Author: SansPapyrus683

solutions/silver/usaco-104.mdx

@@ -5,19 +5,17 @@ title: Haybale Stacking
 author: Óscar Garries, Brad Ma, KJ Karaisz
 ---
 
-<Spoiler title="Hint 1">
+<Spoiler title="Hint">
+
 Prefix sums consists of an $\mathcal{O}(N)$ preprocess, followed by $\mathcal{O}(1)$ queries.
-</Spoiler>
 
-<Spoiler title="Hint 2">
-Now, what's the *opposite* of that?
-</Spoiler>
+The reverse of that would be doing $\mathcal{O}(1)$ *updates*, followed by an $\mathcal{O}(N)$ *post*process.
+Try to figure out what that might look like in the context of this problem!
 
-<Spoiler title="Hint 3">
-$\mathcal{O}(1)$ *updates*, followed by an $\mathcal{O}(N)$ *post*process.
 </Spoiler>
 
 <Spoiler title="Solution">
+
 [Official Analysis (Java)](http://www.usaco.org/current/data/sol_stacking.html)
 
 ## Implementation
@@ -124,4 +122,5 @@ print(pref[n // 2])
 
 </PySection>
 </LanguageSection>
+
 </Spoiler>