| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
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?
UPD: Thank you to all who have responded to this blog, I have read your comments carefully. Hope to be able to quickly resolve it the next time I meet it.
| 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) |
