Can this problem be solved using segment tree?
Difference between en1 and en2, changed 67 character(s)
Can [this problem](http://mirror.codeforces.com/contest/220/problem/B) problem be solved using segment tree. If yes can anyone can tell how to build Seg tree.↵
↵
During combining two segments how do i check for mid and (mid+1)th element in merged segement.↵
↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Siriuslight 2017-02-22 16:40:41 67
en1 English Siriuslight 2017-02-22 16:39:27 232 Initial revision (published)