May be this problem is out of my current skill. But I spend near about 6 hours in it and ended up in some observations only which are not enough to make the solution. I am stuck . How I will merge or solve the thing when after removing a segment , the resulted array will be something like this :-
initial array : 3 1 1 2 2 2 2 1 3 3
after removing all 2 : 3 1 1 _ _ _ _ 1 3 3 ==> 3 1 1 1 3 3
Any help please..
One more thing , I did not understand the editorial of this problem!
Man that problem is rated only 2100. It's only 1000 points more than your current skill level. Try atleast 3000+ rated problems. You will become red in no time then.
Should I leave it :') ? None is helping :'(
Hey,man.Don't lose heart.Try to use linked-list.You can view my solution,in my submission.
Quit with the snarky comments. Perhaps the reason you are rated so low is being overly concerned with ratings in the first place. The solution to the linked problem is conceptually simple to understand (given a reasonable level of understanding of STL structures), and there is no reason to discourage a low-rated person to not read about it.