Educational Codeforces Round

[@arjavrastogi9259]

why is sum(|p-q|) smallest when we subtract in decreasing order?

[@ashishcode]

If you sort an array in any order, the difference between adjacent elements will be the minimum possible. I have done in descending as I wanted the max first.

[@arjavrastogi9259]

@@ashishcode Thanks✌

[@pial9483]

#include #define ll long long using namespace std; const int mx = 150005; int BIT[mx]; int main() { ll T; cin>>T; while(T--) { ll n; cin >> n; // Initialize the BIT array //memset(BIT, 0, sizeof(BIT)); vector bal(n); for(ll i=0; i>bal[i]; } string s; cin>>s; ll sz=s.size(); ll one=count(s.begin(),s.end(),'1'); ll zro=count(s.begin(),s.end(),'0'); vectorzerobal,onebal; //cout

[@yashkhatwani3198]

Thanks amazing explaination

[@vaibhavsingh6035]

great sir , I have tried this question a lot but getting tle

[@nopecharon]

good explanation thank you

[@dhirajthorat6965]

great explanation sir!

[@uu-wl8gw]

Can u tell me what does "p is a permutation" means?

[@ashishcode]

Permutation means it contains all the values from 1 to n exactly once, in any order.

[@uu-wl8gw]

@@ashishcode thank you bro

[@rishiraj2179]

Just Wow

[@shubhampatel6908]

nice explation

[@hrushikeshpatil4033]

Great explanation bro 🤟