Viewing other problems with insights similar to only this insight from Codeforces 1550B: Maximum Cost Deletion:
I had learnt a new approach the minm no. of subarrays of 0 in a binary array in loop if(s i-1!=si) sum++; no of subarrays=sum/2 + 1; by darth_raider
-
USACO 2023 January Contest, Gold: Lights Off
Shared similar insights
- Take advantage of a cycle to avoid rechecking the same bitmask multiple times. Avoid doing repeated work... Ask if you really REALLY need to do something... by tester
- View ALL insights of this problem that are shared
-
Codeforces 1648C: Tyler and Strings
Shared similar insights
- Be careful when multiplying the ways to choose an element (from an array) with a certain value IF previous elements MIGHT have that same value. Consider using a BIT in this case if you can know for sure the number of previous elements with that value. by mathmastersd
- View ALL insights of this problem that are shared
-
Codeforces 1146C: Tree Diameter
Shared similar insights
- When doing a bitmask problem, consider comparing each bit one at a time. When comparing with two numbers, consider the place where the bits first differ by tester
- View ALL insights of this problem that are shared
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0