Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Need help in Modified version of problem.

Revision en1, by papa-ka-para, 2018-01-01 16:53:02

Hello everyone,

I was trying to solve 451 D question. and which turn out to be an easy question due to given constrain of distinct times for each alarm clocks (Please refer to question if you don't understand).

Now I had doubt. What if there could be repetitive values for alarm clocks timings. is it possible to solve this problem with greedy approach ?

If Yes/no , can you please provide proof method.

Thank you (GL & HF)

Tags 451

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English papa-ka-para 2018-01-01 16:53:02 538 Initial revision (published)