Segment tree Problem:maximum correct bracket substring

Правка en1, от Eddagdeg, 2019-10-03 00:30:47

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

Теги #segment tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Eddagdeg 2019-10-03 00:32:32 2 Tiny change: 'bracket susbequence I'' -> 'bracket subsequence I''
en2 Английский Eddagdeg 2019-10-03 00:32:01 50
en1 Английский Eddagdeg 2019-10-03 00:30:47 286 Initial revision (published)