Codeforces Round 809 Div 2 | Problem C : Qpwoeirut And The City Solution | In Hindi | Editorial |

[@kasiruyamagata7716]

U explained it well

[@sahilanand30]

Nicely explained.. Really appreciate your efforts

[@KCODivyanshuKatyan]

Awesome explaination🙌

[@ashishkumaryadav5252]

Best efforts and explanation.

[@sleekrings620]

I immediately implemented it ...and got Accepted.

[@anupamgoyal4601]

Awesome Explained, thankyou so much bhaiya

[@kumarakash5219]

B bata dijye sir

[@sleekrings620]

Bhaiya Making Towers wala bhi bta dena....using DP🤗

[@VivekSharma-qw5ky]

but do we need DP in that question?

[@sleekrings620]

@@VivekSharma-qw5ky Actually not....We can just make an adjacency list for all colours.....and print its size in the end which is basically blocks height

[@VivekSharma-qw5ky]

@@sleekrings620 ohkay

[@ashishkumaryadav5252]

Sir if possible please upload video solution of today's codechef contest, for problem "ACCURATE XOR", it will be very helpful.

[@codingcommunitynewtonschoo8582]

Hi Ashish ! I was going to upload, but due to wifi issues I couldn't upload it. Now , I might not be able to uplaod it. Looking forward to upload today's educational codecforces round solutions...

[@ashishkumaryadav5252]

@@codingcommunitynewtonschoo8582 No issues sir, i understand you try your best but sometimes it is not possible to upload.

[@ashishkumaryadav5252]

@@codingcommunitynewtonschoo8582 Sir if possible problem C

[@tejastank2003]

Pls upload solution of d1 problem

[@prashantgupta2339]

Can we do this using DP

[@shubhanshukumarsingh6133]

it will be better if u write the fully functioal code in your laptop

[@codingcommunitynewtonschoo8582]

Hi Shubhanshu ! I understand if I write fully functional code on laptop it would be better, but what I think is that after seeing the implementation part in the video if you try to implement it by yourself it will give more confidence to you. So thats the thinking behind not writing full code. But I also provide fully functional code in the comments, so you may also have a look there in case you need any help. I hope you got the point.

[@Nikhilsainiharidwar]

Pleased Explain problem B

[@TarunKumar-cn6in]

Waiting for today's B

[@ashishkumaryadav5252]

Sir if possible please upload today's codeforces contest solution problem B

[@codingcommunitynewtonschoo8582]

Uploaded.

[@ashishkumaryadav5252]

@@codingcommunitynewtonschoo8582 Thanks

[@KaranMashru]

#include using namespace std; #define ll long long int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll t, n, i, j, ans, sum; cin>>t; for(;t--;) { cin>>n; ans=0; ll h[n]; for(i=0; i>h[i]; } if((n%2)==1){ for(i=1; i