Dynamic programming
Problems on dynamic programming, including counting paths in a grid, the longest increasing and longest common subsequences, edit distance, knapsack, coin change, dynamic programming on intervals, trees, digits and subsets, and games solved by computing winning states.
The introduction in the Dynamic programming section works through the method step by step. Narrower problem sets are under Knapsack, Bitmasks and Dynamic programming optimization.
Naloge
Sum and XOR#10638
Lahko
Alimzhan loves ACM#10642
Srednje
Data compression#10643
Srednje
Tree with small distances#10656
Zelo lahko
LIS on Tree#10657
Zelo lahko
Lanterns#10661
Lahko
Shopping Fever#10662
Srednje
Double move#10665
Težko
Толя й чудові сторінки#10707
Srednje
Козак Вус та ще одна задача#10713
Zelo težko
Rule 110#10723
Zelo težko
Mentors#10727
Težko
Decoration#10728
Zelo težko
Daisy's Mazes#10731
Zelo težko
Трійка#10747
Zelo lahko
ABC#10753
Težko
Трійки#10760
Zelo težko
Шлях додому#10768
Zelo težko
Перестановки#10770
Zelo težko
Travelling by car#10776
Zelo lahko
Z-Frog 3#10799
Lahko
LIS of Pairs#10821
Zelo težko