Helping The Nature || Codeforces Round 802 Div2 Problem C

[@almamun.]

It's really easy explanation,thanks brother ❤

[@thamidurandilbandara415]

The proof: at the end the operations for of each index i ( 1 0 now in this case the only way to make the difference 0 is to apply suffix on arr[i] because further decreasing arr[i - 1] is stupid case ii:arr[i] - arr[i-1] < 0 in this case the only way to make the differece 0 to apply prefix arr[i-1] because further decreasing arr[i] is stupid because of this we always get the best possible answer

[@competitivecoding-newtonsc9601]

Nice

[@shahinsiddiquei4513]

Great Explanation!!!!!

[@competitivecoding-newtonsc9601]

Thanks Shahin

[@Karthik-ox6jv]

Very nice, best explanation 👍 . The main thing is to understand why we are trying to make everything equal which is clear after watching the video. As you mentioned, it doesn't matter in what order we perform the operations. The method which we follow to get same elements justifies that every move is a must. I still can't prove it but I feel that what we are doing is the best way to do it.

[@competitivecoding-newtonsc9601]

Nicely summarised :)

[@arijitdey8419]

very good explanation..keep up the good work and thanks a lot

[@competitivecoding-newtonsc9601]

Thanks Arijit

[@rudranilacharya5293]

thanks, please also upload the video for lost array and maximum shift after xor of codechef lunchtime 19 june

[@competitivecoding-newtonsc9601]

Will surely try.

[@meetbrahmbhatt1531]

Best! Thanks alot for this.

[@competitivecoding-newtonsc9601]

:)

[@devilronak7262]

Very good explanation 🔥

[@competitivecoding-newtonsc9601]

Thanks Ronak

[@revanthkalavala1829]

Its not always true that addition operation will be used at the end. It might be op1, if min element of array is +ve in array as we are trying to make all elements equal.

[@competitivecoding-newtonsc9601]

Yeah I mentioned that in the video.

[@aryamantodkar6558]

I'm not able to solve div2 C's, how should i improve?

[@competitivecoding-newtonsc9601]

Solve previous div2c's

[@aryamantodkar6558]

@@competitivecoding-newtonsc9601 I have to see the solution of C's, I'm not able to solve them on my own. Should i try practicing lower rated problems?

[@abcefg7045]

how will you proove that this will be the minimum number of operations? and why codeforces gives this kind of problems I hate constructive algo and greedy

[@competitivecoding-newtonsc9601]

I dont have a concrete proof, but I think the first observation helps with the intuition.

[@rahulsrivastava3172]

D wale ka bhi soln upload kr dia kr bhai..

[@EpsilonCodes]

I intern too bro, hard to take out 4 hrs/ a day, and problem D usually gets a poor engagement. Will surely try to though, if I get the time tonight.

[@rahulsrivastava3172]

@@EpsilonCodes theek h bro.. Tere soln and approach mujhe pasand aati.. So i usually get on this channel or one created by IITM peeps.. D mai he thoda issue rehta and D ka soln usually milta ni jldi.. So i said.. Anyways.. Great work.. Keep going bro

[@EpsilonCodes]

@@rahulsrivastava3172 thanks man, appreciate that :)

[@ganeshchowdhary3024]

Lost at implementation part

[@competitivecoding-newtonsc9601]

Which part?

[@ganeshchowdhary3024]

@@competitivecoding-newtonsc9601 Yours is clear. I lost while i am solving. Got AC after seeing your clean implementation

[@aryamankumar645]

Very good explanation as always

[@competitivecoding-newtonsc9601]

Thanks again!