I recently solved CEOI 2009 Harbingers using a Persistent Li Chao Tree and I'm looking for other problems which are solvable with a persistent variant of the convex hull trick. I haven't been able to find any myself so if someone is aware please share some problems.
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3682 |
| 2 | ecnerwala | 3603 |
| 3 | Benq | 3549 |
| 4 | Radewoosh | 3494 |
| 5 | Petr | 3452 |
| 6 | ksun48 | 3413 |
| 7 | maroonrk | 3406 |
| 8 | Miracle03 | 3314 |
| 9 | scott_wu | 3313 |
| 10 | Um_nik | 3299 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | 1-gon | 214 |
| 2 | Errichto | 188 |
| 3 | awoo | 187 |
| 4 | rng_58 | 186 |
| 5 | SecondThread | 183 |
| 6 | Ashishgup | 176 |
| 6 | Um_nik | 176 |
| 8 | maroonrk | 173 |
| 9 | antontrygubO_o | 171 |
| 10 | -is-this-fft- | 169 |
→ Find user
→ Recent actions
Comments (0)
Write comment?
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/23/2021 20:14:33 (i1).
Desktop version, switch to mobile version.
Supported by
