Hello Codeforces Community!
I invite you all to take part in HackerEarth's April Easy, scheduled on the 1st of April at 21:30 IST.
Problems have been set by satyaki3794 and tested by me(paradox1). We are grateful to HackerEarth admins belowthebelt and r3gz3n for their help.
You will be given 6 algorithmic problems to solve in 3 hours. Partial scoring will be used (you get points for passing each test case). Although the contest is targeted towards beginners, we hope even experienced problem-solvers find one or two problems to be interesting. The contest is rated and prizes will be awarded to the top 5 beginners.
The main characters of this round are Mancunian, a die-hard supporter of Manchester United Football Club and his arch-nemesis Liverbird, who supports Liverpool FC. You will help Mancunian get the better of Liverbird by solving algorithmic problems. Good luck and have fun
UPD: Contest has ended. Editorials are out. Congratulations to the top 5!
Begins in 23 hours.
Begins in 22hours and 58 minutes :P
5 minutes to the contest, gl,hv to all :D
Auto comment: topic has been updated by paradox1 (previous revision, new revision, compare).
What is wrong with this code for Mancunian And Fantabulous Pairs, all I did was If there exist a element >curr which is greater than a[curr] (that is next big element exists) then the pair is valid.
I made the same mistake first; check sample explanation carefully — when we are considering some subarray, we work with indices in this subarray, not with global indices.