ABCDEF | Atcoder Beginner Contest 364 Solution Discussion

in D problem: dp (i,j,k) =(the minimum total saltiness when choosing exactly
k dishes from dishes
1,2,…,i so that the total sweetness is exactly
j). i didn't understand why are getting saltiness min, couldn't we have made dp state as : maximum total saltiness instead of minimum.

Man the way you explained E problem ,really that was intuitive and I think I understand explanations more when you typed the words instead of writing with pen

Sir to reach expert on cf till what rating shiuld we UPSOLVE solve in ABC?

bro please the a-z series for which you put up a post, you explain amazingly well

For problem D, why do we have our binary search condition be r-l>1? I'm not totally understanding what the 1 represents in this case.

Please, dont write on pad like your other videos, write with keyboard like this, it looks great and we can understand what u write, otherwise we dont understand your handwriting, please write on pad, I always watch your editorial videos and u explain really well but just for that issue u r solution is difficult to understand(when u write n pad rather then keyboard), love from bangladesh