quandlm's blog

By quandlm, history, 17 months ago, In English

Can you help me this (i think this problem can be used for many orthers) : We have arrange a and q querries (q <= 1e5) and there are 2 type : [cut] 1 x y : put a[y] between index x-1 and x [cut] (ex : a[] = {1,9,3,6,5} and querry is 1 2 4 then a[] = {1,6,9,3,5}) [cut] 2 x : show the value of a[x] [cut] sorry bad english and thanks for the help :DD

  • Vote: I like it
  • -8
  • Vote: I do not like it

| Write comment?
»
17 months ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

Can be solved using implicit cartesian tree (https://codeforces.com/blog/entry/3767).

To be honest, I couldn't find fast an English tutorial on this.

»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

yes sir

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

dmm thanh hóa ăn rau má phá đường tàu.