Each query giving two integer L and R, denoting the time hunter will be in forest.
Query the maximum number of segments that could be hit by any one of point from L to R

BGSHOOT - Shoot and kill - SPOJ

Solution - Github

Level: Medium

Problem 6. Two types of operations can be here.

Add v to all numbers in the range of [l,r]
Query sum in [l,r].

HORRIBLE - Horrible Queries - SPOJ

Solution - Github

Level: Easy

Problem 7. Query(x,y) = Max { a[i]+a[i+1]+…+a[j] ; x ≤ i ≤ j ≤ y }.

GSS1 - Can you answer these queries I - SPOJ

Solution - Github

Level: Medium

Problem 8. Two types of operations can be here.

Modify the i-th element with value v.
Query(x,y) = Max { a[i]+a[i+1]+…+a[j] ; x ≤ i ≤ j ≤ y }.

GSS3 - Can you answer these queries III - SPOJ

Solution - Github

Level: Medium

Problem 9. Query(x1,y1,x2,y2) = Max {A[i]+A[i+1]+…+A[j] } where x1 <= i <= y1 , x2 <= j <= y2 and x1 <= x2 , y1 <= y2 }

GSS5 - Can you answer these queries V - SPOJ

Solution - Github

Level: Hard

Problem 10. Two types of operations can be here.

Set the value of A[i] to x.
Find i and j such that x ≤ i, j ≤ y and i != j, such that the sum A[i]+A[j] is maximized.

KGSS - Maximum Sum - SPOJ

Solution - Github

Level: Medium

Problem 11. Two types of operations can be here.

Apply the xor operation with a given number x to each array element on the segment [l, r].
Query sum in [l,r].

XOR on Segment - CODEFORCES Round #149 (Div. 2) E

Solution - Github

Level: Hard

Problem 12. Given Ranges of the form li ri, denoting the numbers of the leftmost and rightmost sections covered by the i-th poster.

Output the number of posters with visible sections.

POSTERS - Election Posters - SPOJ

Solution - Github

Level: Medium

Problem 13. Two types of operations can be here.

Change the i-th bracket into the opposite one.
Check – if the word is a correct bracket expression.

BRCKTS - Brackets - SPOJ

Solution - Github

Level: Medium

Problem 14. Two types of operations can be here.

Invert switched between [l,r]
Count how many lights are on in the range [l,r]

LITE - Light Switching - SPOJ

Solution - Github

Level: Medium

Problem 15. Two types of operations can be here.

Online Queries
For each k-query (i, j, k), you have to return the number of elements greater than k in the subsequence a_i, a_i+1, …, a_j.

KQUERYO - K-Query Online - SPOJ

Solution - Github

Level: Hard

Problem 16. Two types of operations can be here.

change all numbers in the range of x to y (inclusive) to v.
Count the number of primes between index x and y.

CNTPRIME - Counting Primes - SPOJ

Solution - Github

Level: Medium

Problem 17. Given a string (bracket sequence)

Count the length of the maximum correct bracket subsequence of sequence.

(Div. 1) C. Sereja and Brackets - CODEFORCES

Solution - Github

Level: Medium

Problem 18. Given n ants with there strenths s_i.

When two ants i and j fight, ant i gets one battle point only if s_i divides s_j . An ant i, with v_i battle points obtained, is going to be freed only if vi = r - l

Count how many ants is he going to eat if those ants fight

(Div. 2) F. Ant colony - CODEFORCES- Round #271

Solution - Github

Level: Hard

Problem 19. Given a string (bracket sequence)

Count the length of the maximum correct bracket subsequence of sequence.
Answer how many numbers between indices A and B are divisible by 3.

MULTQ3 - SPOJ

Solution - Github

Level: Medium

Problem 20. Given an arrangement consists of a cuboidal box of size N_x × N_y× N_z made of unit cubes.

Range Update with val = 1 in X, Y ,Z axis.
Report the number of red plants (1) in the cuboidal region with (x1,y1,z1) and (x2,y2,z2)

IOPC1207 - GM plants - SPOJ

Solution - Github

Level: Hard