Segment tree Problem:maximum correct bracket substring

Revision en3, by Eddagdeg, 2019-10-03 00:32:32

Hello community! I'm wondering how to solve 381E:Sereja and Brackets but instead of searching the maximum correct bracket subsequence I'm looking for maximum correct bracket substring! any help would be appreciated and thanks^__^

Tags #segment tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Eddagdeg 2019-10-03 00:32:32 2 Tiny change: 'bracket susbequence I'' -> 'bracket subsequence I''
en2 English Eddagdeg 2019-10-03 00:32:01 50
en1 English Eddagdeg 2019-10-03 00:30:47 286 Initial revision (published)