Codeforces Round 808 Division 2 | Problem C : Doremy's IQ Solutions | In Hindi | Editorial

[@nitronerd2927]

truly man your way of explaining is totally on a different level i automatticaly get a intution while watching your video what to do keep uploading content i really admire your effort, we would be very grateful if you also upload tutorial for d also because upto c we get almost every solution but d very rarely people upload !

[@anjanikumar8671]

very nice sir!

[@deepukumaryadav5268]

osm explanation no match on youtube

[@nabajyotimajumdar4511]

❤

[@divyanshudwivedi3756]

Thanks a lot !!!!

[@harshanarayana6937]

I saw many videos related to this problem and only through this video I understood the solution. You explained so well. Thanks.

[@codingcommunitynewtonschoo8582]

You are most welcome :)

[@codex2976]

Tysm, for this wonderful edutorial

[@ashishkumaryadav5252]

Thanks sir, understood completely.

[@sahilanand30]

Wonderful explanation 🔥

[@FalakAhmedShakib]

I write a code and get wa but i don't find the case , but after your explanation, i got the case, thanks a lot

[@ultrasourus9715]

Good explaination

[@shobhitjain885]

It was a nice explaination... Thanks for your efforts

[@dolos7794]

Great explanation ✨

[@TECHADVICETEAM]

thankyou for explaning entire though process with great counter testcases and examples, really understood everybit of it.

[@dashrathkumar4534]

osm bhaiya

[@KaranMashru]

Code : #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, q, i, j, q1; cin>>t; for(;t--;) { cin>>n>>q; ll a[n], b[n]; q1=0; for(i=0; i>a[i]; } for(i=n-1; i>=0; i--) { if(q1>=a[i]){ b[i]=1; }else{ if(q1

[@codex2976]

Hey, can you please make edutorial of D