Participated in the recent div4 contest. Got stuck in this problem CF 1003 div 4 C2 during the contest. The editorial used a left to right approach, I have used a meet at middle approach. What have I missed? I also learnt the modified binary search after the contest.
It's not that I want to shove off my load to someone else, I can't access the problematic test case. Would appreciate help.
Do you enter the contest?
I did but performed bad. Only solved A which was free. Could have solved B too but I was greedy and jumped to C. Spent two hours, best I could come up with was a O(n
2
) solution, but it didn't work. My current one is O(nlogn) but it's getting WA on test 3.Check for this testcase
Thanks a lot for your help, I genuinely appreciate it. And sorry for the trouble. Hope you have good times ahead.