| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
| Name |
|---|



Could Someone take a look at it. I've been stuck here for more than 4 hours. Please
I'm guessing cache.
Thanks for giving me the problem name. I'll read about it.
Thanks. You are right. Its a cache.
Cache friendliness is one possible reason.
Another reason would be that in Java, memory of a multidimensional array are not allocated in a contiguous block, so
new int[a][2]would createasmall blocks of memory each contains aint[2]. In comparison withnew int[2][a], that's a lot slower.new int[2*a]should be faster (but also harder to read)Thanks for the link. You're a savior. :)