EeOneGuy's blog

Problem
By EeOneGuy, 10 years ago, translation, In English

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?

  • Vote: I like it
  • +13
  • Vote: I do not like it

»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you give me link of this problem?

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can be solved with a treap with implicit key... read this post http://habrahabr.ru/post/101818/

→ Reply