RonoroaZoro's blog

By RonoroaZoro, history, 7 years ago, In English

Hello Codeforces!! .I have a general doubt given an array of max size 10^5 ,how can we find the maximum and minimum element in each subarray in best complexity? Thanks in advance!!!

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

| Write comment?
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Use segment trees.