agc049_d

1 files changed, 2 insertions, 0 deletions

diff --git a/atcoder.md b/atcoder.md
index a585f97..8ea83a2 100644
--- a/atcoder.md
+++ b/atcoder.md
@@ -189,3 +189,5 @@
 - agc049_c: Consider what input looks like when answer is 0
 
 - agc050_c: Formulate the optimal strategy so it is easy to DP with it
+
+- agc049_d: First use structure of convex sequence and fix index of minimum, then a bit like knapsack DP where transitions correspond to adding 1, 2, 3 ... to a suffix or prefix of the sequence, so it's adding 1, 3, 6, ... to the sum, reuse DP between different indexes of the minimum