https://uva.onlinejudge.org/external/110/11078.pdf
Please go through the link..
How can i solve this problem with linear scan. O(n^2) solution is very obvious to me. But linear scan solution o(n), i have no idea,Please help?
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Open Credit System (UVA — 11078), how to do it in O(n)?
https://uva.onlinejudge.org/external/110/11078.pdf
Please go through the link..
How can i solve this problem with linear scan. O(n^2) solution is very obvious to me. But linear scan solution o(n), i have no idea,Please help?
Name |
---|