Is there any RMQ algoritm with single element update and less time complexity than segment tree?
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 162 |
4 | nor | 153 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 150 |
8 | Petr | 145 |
9 | atcoder_official | 144 |
9 | pajenegod | 144 |
Name |
---|
no
No.
If there is, we can sort in faster than time.
Keep getting the smallest element, and update it to ∞ after.
But, it's already a well-known fact that there's no way to sort in faster than time (unless data has some special properties like counting sort or radix sort).
So, it's not possible.