Блог пользователя nafeeur10

Автор nafeeur10, 9 лет назад, По-английски

I'm learning dynamic Programming (DP). I have already learned 0-1 Knapsack, Coin Change and LIS. I want to solve some problems on these categories. Please suggest me some problems of codeforces those are solvable by these 3 algorithms.

  • Проголосовать: нравится
  • +11
  • Проголосовать: не нравится

»
9 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

If you just want to solve Codeforces problems then go through this [ btw if there is no tag for unsolve problems then click show tag for unsolve problems just below your profile info ] And for find out problems of any category you can check this

Good Luck :)

»
9 лет назад, # |
  Проголосовать: нравится +13 Проголосовать: не нравится

A2 Online Judge contains different categories of problem, although not all the problems are on Codeforces (mostly on SPOJ and UVa):

0/1 Knapsack : here

Coin Change : here

LIS : here

The problems are sorted by their difficulties which are shown on the rightmost column, so you may want to solve the problems from the easiest one.

Hope this can help you :)

»
9 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

In this judge online you can find several problems about dp, http://coj.uci.cu/24h/problems.xhtml, plus you can categorize