How to solve a variant of 380C: Sereja and Brackets

Правка en1, от pranet, 2015-10-08 04:15:01

Original problem

If we were asked for the maximum length contiguous bracket sequence, how would this problem be solved)? Constraints may be slightly lower(n=10^5 instead of 10^6).

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский pranet 2015-10-08 04:15:01 291 Initial revision (published)