F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

CRB and Queries

Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 5587    Accepted Submission(s): 1408


Problem Description
There are $N$ boys in CodeLand.
Boy $i$ has his coding skill $A_{i}$.
CRB wants to know who has the suitable coding skill.
So you should treat the following two types of queries.
Query 1: 1 $l\ v$
The coding skill of Boy $l$ has changed to $v$.
Query 2: 2 l $r$ $k$
This is a report query which asks the $k$-th smallest value of coding skill between Boy $l$ and Boy $r$(both inclusive).
 

Input
There are multiple test cases.
The first line contains a single integer $N$.
Next line contains $N$ space separated integers $A_{1}$, $A_{2}$, ¡­, $A_{N}$, where $A_{i}$ denotes initial coding skill of Boy $i$.
Next line contains a single integer $Q$ representing the number of queries.
Next $Q$ lines contain queries which can be any of the two types.
1 ¡Ü $N$, $Q$ ¡Ü $10^{5}$
1 ¡Ü $A_{i}$, $v$ ¡Ü $10^{9}$
1 ¡Ü $l$ ¡Ü $r$ ¡Ü $N$
1 ¡Ü $k$ ¡Ü $r\ ¨C\ l$ + 1

 

Output
For each query of type 2, output a single integer corresponding to the answer in a single line.
 

Sample Input
5 1 2 3 4 5 3 2 2 4 2 1 3 6 2 2 4 2
 

Sample Output
3 4
 

Author
KUT£¨DPRK£©
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-21 18:21:12, Gzip enabled