#!/usr/bin/ruby def solve(s) al=[] ar=[] ah=[0]*s.size as=[] s.size.times{|i| if s[i]==?( al<=r hidx=(l...r).bsearch{|i|ah[i]>=ah[l]+2} next if !hidx s=as.bsearch{|e|e>=hidx}||s.size ret+=1 if s