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?
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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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/