Trilha de Programação dinâmica

[callmerockett]

Problemas podem ser encontrados em https://atcoder.jp/contests/dp/tasks

• [x] #203
• [x] #204
• [x] #205
• [x] #206
• [x] #207
• [x] #208
• [x] #209
• [x] #210
• [x] #211
• [x] #212
• [x] #213
• [x] #214
• [x] #215
• [x] #216
• [x] #217
• [x] #218
• [x] #219
• [x] #220
• [x] #221
• [x] #222
• [x] #223
• [x] #224
• [x] #225
• [x] #226
• [x] #227
• [x] #228

A Frog 1 2 sec 1024 MB B Frog 2 2 sec 1024 MB C Vacation 2 sec 1024 MB D Knapsack 1 2 sec 1024 MB E Knapsack 2 2 sec 1024 MB F LCS 2 sec 1024 MB G Longest Path 2 sec 1024 MB H Grid 1 2 sec 1024 MB I Coins 2 sec 1024 MB J Sushi 2 sec 1024 MB K Stones 2 sec 1024 MB L Deque 2 sec 1024 MB M Candies 2 sec 1024 MB N Slimes 2 sec 1024 MB O Matching 2 sec 1024 MB P Independent Set 2 sec 1024 MB Q Flowers 2 sec 1024 MB R Walk 2 sec 1024 MB S Digit Sum 2 sec 1024 MB T Permutation 2 sec 1024 MB U Grouping 2 sec 1024 MB V Subtree 2 sec 1024 MB W Intervals 2 sec 1024 MB X Tower 2 sec 1024 MB Y Grid 2 2 sec 1024 MB Z Frog 3

[callmerockett]

@FerrariusF