suggest a problem to solve as my 1400-th problem in CF
suggest a problem to solve as my 1400-th problem in CF
| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
https://codeforces.me/contest/375/problem/D
swap(st[node],st[i]) got tle but
st[node].swap(st[i]) got ac
weird
policy based data structure needs to be swap like a.swap(b). I got TLE in a onsite contest because of it.
why not a 800?
https://codeforces.me/problemset/problem/263/A
2001D - Longest Max Min Subsequence