Help needed for a question

Revision en1, by three_nil, 2021-01-10 19:00:37

Given an array A of length N and a number B find the number of subarrays A[l....r] such that A[l]+A[r] and max(A[l...r]) are congruent modulo B
1<=N,B<=500000
 1<=A[i]<=1e9
 The contest of which this question is has ended.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English three_nil 2021-01-10 19:00:37 295 Initial revision (published)