Can You help me with 1183E ?

Правка en2, от omggg, 2020-03-25 17:46:44

Question : https://codeforces.net/contest/1183/problem/E

I want to know how it can be done using 1.Graphs 2.Dynamic Programming

Also there is a harder version of the problem. [problem:https://codeforces.net/contest/1183/problem/H] What changes do i need to make for this in my approach?

P.S my rating is 1600. Any help is appreciated Thanks

Теги #dynamic-programming, #dynamic programing, #graph, #graphs, dp on graphs, #dfs and similar, #graph theory, round 570 div 3

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский omggg 2020-03-25 17:46:44 161
en1 Английский omggg 2020-03-24 22:42:20 271 Initial revision (published)