agc050_d

1 files changed, 2 insertions, 0 deletions

diff --git a/atcoder.md b/atcoder.md
index 2c89faf..9854f1f 100644
--- a/atcoder.md
+++ b/atcoder.md
@@ -191,3 +191,5 @@
 - 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~~
+
+- agc050_d: Try DP, can choose a large state because N is small