here is the link to the problem PROBLEM According to the editorial, this problem is solved using binary search +dp, but can we solve it with 2-D dp or any other way without using binary search ?
here is the link to the problem PROBLEM According to the editorial, this problem is solved using binary search +dp, but can we solve it with 2-D dp or any other way without using binary search ?
can anyone help with solving this question of codechef , which I am unable to solve? here is the link to the question ZERO THE PATH , thx in Advance.
how to mark all the nodes that are in a cycle in a graph?