Can we solve this problem without binary search?

Правка en2, от nqs_1, 2020-04-01 01:02:33

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? Thx in advance.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский nqs_1 2020-04-01 01:03:39 18
en3 Английский nqs_1 2020-04-01 01:03:03 48
en2 Английский nqs_1 2020-04-01 01:02:33 1 Tiny change: 'he problem[PROBLEM](' -> 'he problem [PROBLEM]('
en1 Английский nqs_1 2020-04-01 01:01:56 265 Initial revision (published)