| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
0
Thanks a lot! I would never think about it. |
|
0
|
|
0
But some people see. Maybe it's personal, individual? |
|
0
"they can keep up the grind" — that's the main problem. Newbies solve hundreds of problems and don't get any result, because they are grinding. They skip hard problems, trying to maximise a number of solved problems, not their skills. |
|
+3
There is actually a good post about it: this one |
|
0
Use an ArrayList of Integers and Collections.sort(), it's always O(nlogn). Arrays.sort() is O(n^2), although docs say it is O(nlogn). |
|
+1
Thanks. |
|
0
What was the key idea for A? |
|
0
Maybe, it's not that useful for competitive programming, but it allows to write code in a modern style. Just try to write a solution in a Java 7 style and you'll feel the difference. |
|
0
. |
| Name |
|---|


