Samarth12's blog

By Samarth12, history, 6 weeks ago, In English,

Suppose I have an array of positive integers and I concatenate it K times. Now I want to count the number of subarrays with sum<=S Constraints:- N<=10^5(number of elements), S<=10^5 , K <= 10^8 , 1<= A[i] <= 10^9. Any idea?

 
 
 
 
  • Vote: I like it
  • -16
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

You should post problem source. Since it can be from an ongoing contest.

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it -16 Vote: I do not like it

    Well it isn't and you would not be able to access the problem link....although I solved it:)