Hi. I've been taking a look at this problem from APIO 2007. I'm not really proficient at these kinds of problems (greedy + heap, possibly applications of dp?). Do any of you guys have nice problems to recommend? As you can see from my rating, I'm not that good yet so don't give me Div 1. D and E problems please...
→ Pay attention
Before contest
Codeforces Round sponsored by NEAR (Div. 1 + Div. 2)
3 days
Register now »
Codeforces Round sponsored by NEAR (Div. 1 + Div. 2)
3 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 155 |
| 5 | -is-this-fft- | 150 |
| 6 | Petr | 148 |
| 6 | SecondThread | 148 |
| 8 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/16/2024 01:54:18 (l1).
Desktop version, switch to mobile version.
Supported by
I actually know 2 good problems on greedy + set/heap there on codeforces, but their statements are avaible only in russian (they're from technocup 2016, which is avaible only in russian locale). Do you mind using google.translate to translate them?
That's probably fine, just in case I can actually make sense of it.
Here you are.
http://codeforces.net/gym/100944/problem/D?locale=en
http://codeforces.net/gym/100950/problem/E?locale=en
Second is a bit harder than first, but ideas are almost the same :)
You can write me if you will be having troubles understanding the statements.