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?
How can I identify if a problem can be solved using regret greedy(greedy with heap)?
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?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en4 |
|
SYCu | 2025-03-24 12:09:46 | 2 | Tiny change: 'o quickly resolve it t' -> 'o quickly solve it t' | |
| en3 |
|
SYCu | 2025-03-24 12:09:09 | 63 | ||
| en2 |
|
SYCu | 2025-03-24 03:59:20 | 95 | Tiny change: 'et greedy?' -> 'et greedy?\n\nUPD' | |
| en1 |
|
SYCu | 2025-03-22 19:57:12 | 307 | Initial revision (published) |