I was doing yesterday's division 3 round, when I stumbled upon problem D. I coded together something that frankly shouldn't work but somehow does and didn't fail to hacks either. I was just wondering if anyone could come up with a rigourous(or non rigourous, idrc) proof of why my solution works.

my code: https://codeforces.me/contest/1921/submission/241787069

The way I got this idea was just doing some stuff on paper until I realized that the max diff for each corresponding element could only really be found at two reasonable spots.

Thanks!

Hey cf ppl,

I was just wondering why set.count() works a lot faster than using vector.find(), from personal coding experience

This question seems to have already been answered on stack overflow, but it gave a what I thought as an incorrect answer, telling me that vector.find() would run faster than set.count() because it breaks as soon as it reaches the first occurence while set.count() would continually iterate through the whole array.

Thanks

too complicated :!

The other day, I was sitting in my lawn chair and staring into the skies when i saw a green moon.

I was absolutely shocked and I instantly kenw it was a sign that I would get pupil. Sure enough, a week later, through some divine providence, I managed to pull through and achieved the best rank of Pupil. To all those ready to downvote, I urge you to use this as a chance to start a new year's resolution of having a sense of humuor.

Gracias bois, keep coding!

Hello!

I'm looking for a partner or team for the universal cup coming up this weekend. If you're available, please leave a comment. Thanks!