Hello everyone, with the help of you guys and helpful blogs, I am able to solve A and B pretty much every time, and most of the time C too(Div >=2 of course).
Here is the problem->Contest #576 Div2 C-MP3
And here is my code->here
For those of you who don't want to see code, here is what I did
-made vector of distinct intensities(which is sorted)
-maintained a freq map for frequency of those intensities
-while the condition of the bits is not satisfied, greedily removed the digits from left and right using two pointers
If you understood please do tell me.
If you had same problem, the algorithm is sub-optimal with the greedy approach, If the hints are not enough, the logic is to find the exact no. of distinct bits needed to be in the disk, and then we just traverse that consecutive bits and find the minimum(if the maximum sum of consecutive bits = x then ans=n-x)
https://codeforces.com/contest/1199/submission/120241055
Stupid question, now I have revisited and also a couple of people have the same doubt, good to see that.
I believe now I have solved similar reactions from you :)
Coming to the doubt, the above method is good except that greedy approach. now that I have mentioned that there is error in the logic you can think accordingly
Well, greedy is not working, also look at constraints.
Can you figure out, the exact no. of distinct numbers required?
Now you know the distinct numbers, also from the procedure... the distinct numbers should be? consecutive