How can we solve spoj problem INCSEQ using segment tree?
Here is the link to the problem
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
How can we solve spoj problem INCSEQ using segment tree?
Here is the link to the problem
Name |
---|
I think, that you can solve this task in such way :
You will use K segment trees.
1. Sort all elements of given array in non-decreasing order.
About sort : if elements are equal — the minimal element will be element which has the rightmost position.
2. You should update every segment tree in such way :
3. Le'ts add the value of sum in the current segment tree in position myElementPosition.
My AC code here
If I want to find distinct increasing subsequence as in this question http://www.spoj.com/problems/INCDSEQ/
what modification I need to make in the above code?
Another ways to solve the problem:
Can you please explain how BIT is working for this problem? Also , why we need to increment a[i] during scanning the input
Increment is because BIT is 1-based structure. Bit-based solution is simply in k turns calculate on each turn number of sequences of length i ending in pos.