APPROX2 - Editorial

editorial
, ,
21

@aayush yes it is working

22

@aayush just submitted

23

is this work O(nlogn) in count solns for following test-
1
10 8
4 4 4 4 4 4 4 4 4 4

24

@joney for each of test case it is O(nlog(n))

25

O notation implies worst case for any type of the test case

26

if you have any doubts regarding this post the ask i will try to clear your doubt

27

http://www.codechef.com/viewsolution/3950897 . Please point out whats wrong in this code. It give TLE for subtask 2.

28

This can be solved using dp (kind of)
solution : https://www.codechef.com/viewsolution/11052793

29

https://discuss.codechef.com/users/25511/ma5termind
why are you using two condition of itrator

if(it!=arr.end())

And
it1–

If(it1!=it)
In your code please explain me

30

@ma5termind
Please answer my dout