How to solve this problem in dp?

Правка en1, от InshaAllah, 2018-04-18 17:14:40

http://codeforces.net/contest/337/problem/A

There are three tags for this problem( Greedy, Graph matching, dp). I have solved it using a greedy technique. Please help me to solve it using dp. Thanks, advanced!!!

N:B You can also suggest the graph matching solution.

Теги #dp, graph matching

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский InshaAllah 2018-04-18 17:14:40 303 Initial revision (published)