How can I identify if a problem can be solved using regret greedy(greedy with heap)?

Revision en1, by SYCu, 2025-03-22 19:57:12

In today's competition, I only realized in the last minute that problem D could be solved using regret greedy rather than DS with DP. How should I train to quickly recognize when a problem can be solved using regret greedy?

Tags greedy, training, -delta

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English SYCu 2025-03-24 12:09:46 2 Tiny change: 'o quickly resolve it t' -> 'o quickly solve it t'
en3 English SYCu 2025-03-24 12:09:09 63
en2 English SYCu 2025-03-24 03:59:20 95 Tiny change: 'et greedy?' -> 'et greedy?\n\nUPD'
en1 English SYCu 2025-03-22 19:57:12 307 Initial revision (published)