Prefix Sum && Partial Sum

[@sheriftalaat6248]

شرحك عظمة اتمنى تكمل لغاية ما تعمل كتاب فى problem solving انا اول واحد هيشتريه

[@mahmoudayman8873]

تسلم ربنا يخليك♥️ هيبقي صعب شوية موضوع الكتاب دا لان هيحتاح وقت ومجهود كبار وللاسف مفيش حاليا

[@jlassicp]

ممكن لينك المسألة الأولى (D. range sum query)

[@ELRAKY-ik2nx]

عاااااش😍😍😍😍😍😍

[@user_41632]

Static range query = size slide window? and thanks for you.

[@mahmoudayman8873]

No Sliding window is an application of topic called (( 2 pointers )) it's the subject of the next session

[@user_41632]

@@mahmoudayman8873 ❤

[@abodora532]

32:28 #include #include using namespace std; #define ll long long int main() {char nexchar,lastchar; vectorvec; bool isfirst=true; vec.push_back(0);int i=0; while ((nexchar=getchar())!=' ') { // don't forget; if (isfirst) { isfirst=false; lastchar=nexchar; vec.push_back(i); continue; } if(lastchar!=nexchar) { vec.push_back(i); lastchar=nexchar; } else { vec.push_back(++i); lastchar=nexchar; } } int num,l,r; cin>>num;while(num--) { cin>>l>>r; printf("%d ",vec[r]-vec[l]); } } // ms.erase(ms.begin()); //setseto;//same as piriority queue but it is sorted and unique حل الولد دا صح