← All problemsSign in

Distinct Values Queries

CSESRange QueriesOpen on judge ↗

You are given an array of n integers and q queries of the form: how many distinct values are there in a range [a,b]? Input The first input line has two integers n and q: the array size and number of queries. The next line has n integers x_1,x_2,\dots,x_n: the array values. Finally, there are q lines describing the queries. Each line has two integers a and b. Output For each query, print the

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start