Codeforces Round 849(Div-4) Screencast || Thinking Out Loud and Solving All Problems

[@joeljacob4685]

wow!! your intuiton to problem E was amazing!!

[@DawnCoder]

I was able to do all the problems but not during the contest unfortunately.

[@sauravbharti2709]

Incredible binary search in problem G2, thanks bro

[@louisfghbvc]

your G2 approach is so smart!!!

[@mixshots1801]

thanks for uploading bro , you explain very precisely

[@sicklips]

Could you please mention extentions you are using, like copying sample cases , listen to competitive companion and sample accepted or not ?

[@ITACHIUCHIHA-dr8sz]

Was major missing your streams man !!

[@saurabhkumarsingh9550]

Please make a video on setup of your Sublime with competitive companion

[@jahidulislam1069]

Need a video of your sublime setup...

[@akshatchaube1213]

Can you also upload the codes for all these questions

[@adarshanand732]

harisam please upload videos for atcoder beginner this latest one i am ur biggest follower it would really be of immense help

[@secondarypemail7181]

Actually in the first 5 mins the Codeforces main website was down so I had to login to the alternative sites ,hence the time 3 mins was wasted till I was able to solve first 4 problems within 30 mins.Anyone else faced the same problem?

[@noobnessmee]

yeah, its a common problm in div 4 contests. 30K ppl gave contest

[@secondarypemail7181]

@@noobnessmee Yes even with 3000 rank only +50 delta,it shows that how tough competition is there in div 4 rounds

[@samarthahuja5914]

good stream

[@manaskumarpanda8961]

Really loved❤ your all explanation and implementation .
plz doing this type long video .

[@ahmedhawater7522]

keep it up

[@Avuvos]

I solved E using DP, but your solution is very nice!

[@stepup7052]

can you share your solution

[@erenyeager4452]

can you share your solution?

[@Avuvos]

@@erenyeager4452
void solve() {
int n;
cin >> n;
vector A(n);
for (auto &a: A) cin >> a;

vector dp(n + 1);
dp[n][0] = 0;
dp[n][1] = 0;
dp[n - 1][0] = A[n - 1];
dp[n - 1][1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (i != n - 2) {
dp[i][1] = -A[i] + max(dp[i + 1][0] - 2*A[i + 1], dp[i + 1][1] + 2*A[i + 1]);
dp[i][0] = A[i] + max(dp[i + 1][0], dp[i + 1][1]);
}
else {
dp[i][0] = A[i] + A[i + 1];
dp[i][1] = -A[i] - A[i + 1];
}
}

cout

[@epicunreal524]

Why n-1

[@yagniktalaviya2146]

Hey there, I see there are multiple dark theme mods available for codeforces and yours is better, could you suggest how can we use it?

[@alessiodvt]

Extension dark reader

[@mradulagrawal1579]

can anyone tell me was this contest unrated ?

[@Harisamsharma]

For those asking about how I automatically parse and run test cases, you can watch this video: ua-cam.com/video/gg1cwWMnLhc/v-deo.html

[@shishankrawat2105]

1st like

[@rachitsaxena7019]

Divya kon hai 😂

[@rohitsatpute9578]

🌚