Given an array of integers A and k queries. Each query will be like that:
1.Reverse an segment from l to r.
2.Output the sum of integers from l to r.
N<=10^5,k<=10^4.
Can this problem solved by using segment trees. How?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Given an array of integers A and k queries. Each query will be like that:
1.Reverse an segment from l to r.
2.Output the sum of integers from l to r.
N<=10^5,k<=10^4.
Can this problem solved by using segment trees. How?
Name |
---|
Can you give me link of this problem?
http://olympiads.kz/files/kz-2012-republic-statements.zip. Problem G
Can be solved with a treap with implicit key... read this post http://habrahabr.ru/post/101818/