add comment on edge-divide&conquer

baobaomaomeng · Oct 15, 2019 · 7556c65 · 7556c65
1 parent b5bd819
commit 7556c65
Show file tree

Hide file tree

Showing 2 changed files with 10 additions and 11 deletions.
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Graph/Tree/Edge-Divide&Conquer.cpp b/Graph/Tree/Edge-Divide&Conquer.cpp
@@ -1,5 +1,5 @@
 // Created by calabash_boy on 2019/10/15.
-// Given S, calculate \
+// Luogu 5115.SAM + 边分 + 虚树DP: Given S, calculate
 // \sum_{i<j and LCP(i,j)<=K1 and LCS(i,j)<=K2}{LCS(i,j) * LCP(i,j)}
 // 最大度数有限制（例如parent树27度），则不需要三度化。
 #include<bits/stdc++.h>