Codeforces 455A Boredom - Defining the DP - 1D DP | Dynamic Programming

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/1d-dp/boredom-defining-the-dp

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/1d-dp/boredom-defining-the-dp

Repovive

Codeforces 455A Boredom - Defining the DP - 1D DP | Dynamic Programming | Repovive

1.1.1. Define the states Let dp[i]dp[i]dp[i] = maximum points out of values from 111 to iii. You want to compute dp[M]dp[M]dp[M], where M=max⁡(a1,a2,…,an).M = \max(a_1, a_2, \dots, a_n).M=max(a1​,a2​,…,an​). If you define your dp like this, the base case is simple.

$1.$ 1. Define the states Let $dp[i]$ dp[i] = maximum points out of values from $1$ 1 to $i$ i. You want to compute $dp[M]$ dp[M], where $M = \max(a_1, a_2, \dots, a_n).$ M=max(a1,a2,…,an). If you define your dp like this, the base case is simple.