Id | Name | Done | Resources | Problems | Code | Difficulty |
---|---|---|---|---|---|---|
312 | Digit DP | 1 | 1 | code | 1 | |
313 | CHT | 1 2 | 1 | code | 2 | |
314 | Dynamic CHT | 1 | 1 | code | 2 | |
315 | Persistent CHT | code | 3 | |||
316 | Li Chao Tree | 1 2 | 1 2 | code | 2 | |
317 | Persistent Li Chao Tree | 1 2 | code | 2 | ||
318 | Extended Li Chao tree | 1 | 3 | |||
319 | Divide and Conquer Optimization | 1 | 1 | code | 1 | |
320 | Knuth Optimization | 1 2 | 1 | code | 1 | |
321 | Substring DP | 1 | 1 | code | 1 | |
322 | Bounded Knapsack | 1 | 1 | code | 1 | |
323 | SOS DP | 1 | 1 | code | 1 | |
324 | Subset Sum Convolution | 1 | code | 2 | ||
325 | Dynamic Submask Count | 1 | code | 2 | ||
326 | DP over Divisors | code | 1 | |||
327 | Subset Sum in SQRT | 1 | code | 1 | ||
328 | LIS Range Query | 1 | 1 | 2 | ||
329 | Aliens Trick | 1 | 1 | 2 | ||
330 | 1D1D DP Optimization | 1 | 1 | code | 3 | |
331 | Connected Component DP | 1 | 1 | code | 3 | |
332 | Slope Trick | 1 | 1 | 2 | ||
333 | Subset Union of Bitsets | 1 | code | 2 | ||
334 | Number of Subsequences Having Product at least K | 1 | code | 2 | ||
335 | Hirschbergs Algorithm | 1 | 1 | 3 | ||
336 | Broken Profile DP/plug dp | 1 2 | 1 | 2 | ||
337 | XOR Equation | 1 | 1 2 3 | 2 | ||
338 | "x2 +1 trick" | 1 | 1 | code | 1 | |
339 | Open and Close Interval Trick | 1 | 1 | 1 | ||
340 | Bitmask DP | 1 | 1 | 1 |