Where to find problems that involve finding f(x) "over all subarrays/pairs"
Difference between en1 and en2, changed 0 character(s)
Like finding sum of each possible subarray, Finding sum of max of each subarray, Finding sum of product of each possible pair in the array, etc.↵
↵
They usually involve using modulo as well. Thanks in advance for the help!↵
↵
So far I've just been googling "codeforces over all subarrays" 

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Alchemi5t 2021-09-23 11:20:39 0 (published)
en1 English Alchemi5t 2021-09-23 11:19:38 364 Initial revision (saved to drafts)