Comments
0

there are only two condition of "NO" let n=no of odds 1)if n<k 2)n>k and n-k is odd

it is wrong , it should be dp[i][0]=i*b[i]+dp[i-1][1]; dp[i][1]=max(dp[i-1][0],dp[i-1][1]); because if you do not select i , then you have both option to choose i-1 or not and who ever is max take the ans

On repeatingWhich IDE do you use?, 5 years ago
0

any solution for windows?? anyone please

On gop2024Codeforces Round #569, 5 years ago
-11

good luck

0

thanks buddy for helping me!! i change that and it got ACCEPTED!!! thanks

0

https://codeforces.com/contest/1176/submission/55374222 i have done the same !! why it giving me tle ?

0

thanks!!

On scanhexCodeforces Round #534, 5 years ago
-8

YA I ALSO THINK SO PLEASE I REQUEST THE SETTERS TO UPLOAD IT SOON BECAUSE I EAGERLY WANT TO KNOW ABOUT THE DIV2D PROBLEM SOLUTION

On scanhexCodeforces Round #534, 5 years ago
-27

how to solve div2 d problem ??

0

codechef server down in middle of the contest causes my rank to float to 600

On MikeMirzayanovNew Year Gifts 2019!, 5 years ago
0

thanks mike for giving us such a wonderfull platform.

On 300iqCodeforces Round #530, 5 years ago
0

when editorial will come ??

thanks for that

0

i cannot understand why u use k-=mn; then func( x, min(k+1,x) ) in your code can you eloborate please