→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 01:37:46 (g2).
Desktop version, switch to mobile version.
Supported by
Indeed, multiplying everything by 2 helps because you can make each person enter at an even time and leave at an odd time, so you don't have to worry about what to count first.
can you give me a case where marking [a +1] [b+1 -1] fails. And thank you tenshi_kanade you always help people out :)
There are many tricky cases in this problem. For example, try the following out...
7 7 4 4 6 4 7 4 8 4 9
Answer in this case is 3 3.
Another one...
10 15 3 10 15 10 15 10 15.
Here, the answer is 3 3 too.