int main() { int high, low; int l, r; scanf("%d", &N); scanf("%s", S + 1); highs.init(N + 1); lows.init(N + 1); high = 0; low = 0; highs.update(0, 0); lows.update(0, 0); middle[0] = 0; qs[0] = 0; for (int i = 1; i <= N; i++) { middle[i] = middle[i - 1]; qs[i] = qs[i - 1]; switch(S[i]) { case '(': high++; low++; middle[i]++; break; case ')': high--; low--; middle[i]--; break; case '?': high++; low--; qs[i]++; break; } highs.update(i, high); lows.update(i, low); } scanf("%d", &Q); for (int q = 0; q < Q; q++) { scanf("%d%d", &l, &r); l--; printf("%s\n", query(l, r) ? "Yes" : "No"); } return 0; }
int main(){ int n, ans; cin >> n; RMQ r; r.init(n); for(int j=0;j<n;j++){ cin >> a[j]; r.update(j,-a[j]); } for(int x=0;x<n;x++){ int head = 0,tail = x,now; ans = 0; while(head != tail && x > 0){ now = (head + tail)/2; //cout << x << "-L:" << head << " " << tail << " " << now << " " << r.query(now,x) << endl;// if(r.query(now,x)>=-a[x])tail=now; else head=now+1; } ans += x - head; head = x,tail = n-1; while(head != tail && x < n-1){ now = (head + tail+1)/2; //cout << x << "-R:" << head << " " << tail << " " << now << " " << r.query(x,now) << endl;// if(r.query(x,now)>=-a[x])head=now; else tail=now-1; } ans += head - x; cout << ans << endl; } return 0; }
void solve4(RMQ& rmq, vector<int>& FIRE, int N, int P){ for (int i = P; i < N; i++){ int start = i - P; int end = i - 1; FIRE[i] += rmq.query(start, end); rmq.update(i, FIRE[i]); } }
REP(i, m) { int s = sorters[i].first; int t = sorters[i].second; int minLength = rmq.query(s-1, t); //dp[t] = min(minLength + 1, dp[t]); int next = min(minLength + 1, rmq.query(t-1, t)); rmq.update(t-1, next); }
int main(){ cin.tie(0); ios::sync_with_stdio(false); ll n,q,c,x,y; RMQ rmq; cin >> n >> q; rmq.init(n); rep(i,q){ cin >> c >> x >> y; if(c == 0){ rmq.update(x,y); } else{ cout << rmq.query(x,y) << endl; } }