Louis Aeilot's Blog
blog.aeilot.top
DP 系列。 題面 看題， Luogu 合併相鄰的相同數字，變成數字加一。求獲得的最大值。 思考 最初想到的是基礎的區間 DP，不做解釋： 1 2 3 4 5 6 7 8 9 10 11 12 13 long long ans = 0 ; for ( int len = 2 ; len<=N; len++){ for ( int i = 1 ; i+len -1 <=N; i++){ int y …
Louis Aeilot's Blog 的其他文章
- How Close Is FlashAttention to the Limit? Understanding Attention Through Data Movement
- Beyond FLOPs: How COSMA Builds Parallel Matrix Multiplication from Communication Bounds
- The Red-Blue Pebble Game: Why Faster Processors Still Have to Move Data
- Git Needs a Trash Can
- RoPE: Properties, Patterns, and Long-Context Behavior
讨论
登录后参与讨论
还没有评论，来说第一句吧。