Implemented arc115_e

1 files changed, 2 insertions, 0 deletions

diff --git a/atcoder.md b/atcoder.md
index d8bfada..fcd693f 100644
--- a/atcoder.md
+++ b/atcoder.md
@@ -229,3 +229,5 @@
 - arc106_f: Find a formula, you can designate one hole in each part as special, then connect non-special holes with special holes
 
 - arc115_d: First solve the easy case where it is a tree with math, then you can use some more math to generalize for a connected graph, don't be limited into only thinking about DP and those kinds of algorithms
+
+- ~~arc115_e: DP and data structures, can be solved with cartesian trees but solving with segment trees is a lot harder~~