| # | 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 |
| # | 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 | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
May be 1600 soon. Wanted to reach expert soon. Putting hardwork consistently. Fingers Crossed |
|
0
I got the approach btw. Thanks for replying |
|
0
Yup now got AC by iterative Code : Iterative Solution Thank you Saul-Goodman |
|
0
Bro I did same as yours appraoch but getting TLE on test 18, can you please see and help me how to avoid it. Link to solution : Solution |
|
-11
chup chapri. Don't write these useless messages |
|
+3
F is very similar to : THis Problem |
|
-8
It would be great if you create mashup for aspiring experts |
|
On
tejas10p →
Invitation to CodeChef Starters 71 - 28th December, rated for Divs 2, 3 & 4, 4 years ago
0
And what about lunchtime, I don't see it in their calendar. |
|
0
Did you got any segment Tree approach for this problem? |
| Name |
|---|


