Help me please.
I have problem.
Given array.
You have Q queries.
You need to find most frequent number between l and r. n, Q <= 500 000.
I have problem.
Given array.
You have Q queries.
You need to find most frequent number between l and r. n, Q <= 500 000.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Name |
---|
Maybe, it can be solved by MO's algorithm with big constant(~5).
Let's maintain:
cntx -> the number of occurance of x,
cntBlockx -> the number of elements, that occurrence lie in this block(if K is size of blocks, occurrence must be between [K * Block: (K + 1) * Block)).
valsx -> the vector with elements, that occurrence is equal to x.
When adding/removing elements, we must update each of them. Deleting can be done in 1 operation. Swap with last, delete last(maintain extra array posx, the position of x in vector).
Finding answer will be ez. Find maximum block mx that, cntBlockmx > 0, find maximum number x in this block, that vals[x].size() > 0.
Sorry for my poor English.
Do you know smth about segment tree?