→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Comments
|
On
ko_osaga →
Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial, 12 months ago
0
why cnt/2 shouldn't it be cnt — 1 as for all the v[i] B will act first and increase value by 1 except in the starting case as A has to make the first move |
|
0
okk... i can see now.... understand it!! great solution what i was doing for a particular i finding the largest value in the cnt array and if the value == i then find the max element smaller than i. this i achieved by storing 2 values in the node (largest and value smaller than it) -> and merge the nodes accordingly... but it is giving TLE on 6 |
|
0
- |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/14/2026 14:01:53 (g2).
Desktop version, switch to mobile version.
Supported by
