diff --git a/content/6_Advanced/LCT.mdx b/content/6_Advanced/LCT.mdx
index 2347c69a08..70199790d0 100644
--- a/content/6_Advanced/LCT.mdx
+++ b/content/6_Advanced/LCT.mdx
@@ -75,6 +75,11 @@ When a node in a splay tree is accessed, a splay operation is performed on the n
 		title="Link Cut Tree Implementation"
 		url="https://github.com/bqi343/USACO/blob/master/Implementations/content/graphs%20(12)/Advanced/LCT.h"
 	/>
+	<Resource
+		source="CF"
+		title="Fully Dynamic Trees Supporting Path/Subtree Aggregates"
+		url="https://codeforces.com/blog/entry/103726"
+	/>
 </Resources>
 
 A link cut tree is a data structure that uses splay trees to represent a forest of rooted trees and
@@ -101,6 +106,8 @@ Adding an edge or removing an edge between two vertices are standard features of
 Checking if there's a path between two nodes is the same as checking if they're part of the same tree.
 To check if two nodes are part of the same tree, we can check if the roots of the trees of the two nodes are the same.
 
+### Implementation
+
 <LanguageSection>
 <CPPSection>