Educational Codeforces Round 151 (Div. 2) Editorial- Problems A, B, C, D

Hello everyone. This is the video editorial for Educational Codeforces Round 151 (Div. 2). Hope you all enjoyed the video. Like and subscribe for more such content. In case of doubts, post a comment below!
About us:
Programming Club, CFI, IITM exists with the sole purpose of increasing awareness about coding both within our beloved "insti" and outside as well. With an especially active CP community, we aspire to take IITM to grand heights in competitions like ICPC.
More about us: cfi.iitm.ac.in...
For business purposes contact:
LinkedIn: / programming-club-cfi-i...
Mail us at: [e-mail]
Follow us on Instagram: / programmingclub_iitm

[@secondthread-uc9bd]

the suffix idea in D was amazing ty

[@haricharanbalasundaram3124]

Thanks!

[@ayushmishra6575]

Amazing bro !! i used different approach for C but yours was better. Thanks

[@programmingclub_iitm]

Thanks!

[@harveycrimsond3947]

Hey, Since you u guys know from experience. Is it realistic to expect to become a master on CF in 14 months if you practice 10-12 hours a day ?

[@vaibhavsingh2197]

Can you explain the intuition behind max suffix part in D. Like can you please proof it🙏🙏

[@haricharanbalasundaram3124]

From a given index i, consider everything to the right of it. If the sum from the current index to a particular index j is negative, that part will contribute 0, and only the suffix from j till end of the array will be considered. Essentially like this, the maximum of all suffixes will be considered.

[@shivanshagrawal8810]

soln of c was amazing

[@haricharanbalasundaram3124]

Thanks!

[@kasiruyamagata7716]

D can be solved in O(n) Instead of nlogn

[@haricharanbalasundaram3124]

True, it can be done in O(n) using suffixed maximums, I realized that after the contest

[@CristianoRonaldo-ku1uz]

Hey man !! Five contest before I was at 1300 but then all negative deltas in next five contests and became newbie. Pracitisng regularly but somehow not getting the results. Should I have a break or continue grinding?

[@kasiruyamagata7716]

Itz normal Even I could only solve 3 qns today

[@haricharanbalasundaram3124]

Depends on you, I think it's a personal thing. I usually give virtual contests to have an actual feel of the contest, if my rating decreases.

[@law26504]

Bekar no proof just giving your own solution with ad hoc assumptions

[@haricharanbalasundaram3124]

Tell for what question you need the proof, I'll provide it.

[@law26504]

@@haricharanbalasundaram3124 D

[@secondthread-uc9bd]

i mean thats on u , cannot even derive proof after looking at solution , wants everything spoonfed , cringe newbie.

[@haricharanbalasundaram3124]

@@law26504 From a given index i, consider everything to the right of it. If the sum from the current index to a particular index j is negative, that part will contribute 0, and only the suffix from j till end of the array will be considered. Essentially like this, the maximum of all suffixes will be considered.