| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
Question To Be Done in O(N)
Hi, I wanted to solve this question in O(N) but couldn't think of it. I did it in O(N logN ) using priority queue but can somebody provide me O(N) solution.
https://postimg.org/image/c31iexg13/
The link of question is not opening now, so I have shared the pic of question.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en9 |
|
rahul_1234 | 2016-07-07 16:32:25 | 0 | (published) | |
| en8 |
|
rahul_1234 | 2016-07-07 16:28:06 | 0 | (saved to drafts) | |
| en7 |
|
rahul_1234 | 2016-07-07 16:27:30 | 11 | ||
| en6 |
|
rahul_1234 | 2016-07-07 16:03:50 | 2 | Tiny change: '1iexg13/\nThe link' -> '1iexg13/\n\nThe link' | |
| en5 |
|
rahul_1234 | 2016-07-07 16:03:35 | 58 | ||
| en4 |
|
rahul_1234 | 2016-07-07 16:00:51 | 84 | ||
| en3 |
|
rahul_1234 | 2016-07-07 15:58:58 | 67 | ||
| en2 |
|
rahul_1234 | 2016-07-07 15:47:20 | 2 | Tiny change: 'olution.\nhttps://' -> 'olution.\n\nhttps://' | |
| en1 |
|
rahul_1234 | 2016-07-07 15:46:57 | 227 | Initial revision (published) |
