随笔分类 - 来源：公开赛
摘要：链接 A B C D E F G H I J K \(\color{green}{\texttt{+5}}\) \(\color{red}{\texttt{+1}}\) \(\color{green}{\texttt{+4}}\) \(\color{green}{\texttt{+1}}\) \(\
阅读全文
摘要：链接 A B C D E F \(\color{gray}{\texttt{-}}\) \(\color{green}{\texttt{+}}\) \(\color{gray}{\texttt{-}}\) \(\color{green}{\texttt{+6}}\) \(\color{green}{
阅读全文
摘要：A B C D E F \(\color{green}{\texttt{+3}}\) \(\color{green}{\texttt{+}}\) \(\color{green}{\texttt{+3}}\) \(\color{green}{\texttt{+}}\) \(\color{red}{\t
阅读全文
摘要：Bosses Park Spiral Cities Maze Swap \(\color{green}{\texttt{+}}\) \(\color{green}{\texttt{+}}\) \(\color{red}{\texttt{-}}\) \(\color{red}{\texttt{-}}\
阅读全文
摘要：链接 A B C D E F G H I J K \(\color{green}{\texttt{+4}}\) \(\color{red}{\texttt{+1}}\) \(\color{gray}{\texttt{+}}\) \(\color{gray}{\texttt{+}}\) \(\colo
阅读全文
摘要：链接 A B C D E F G H I J K L \(\color{green}{\texttt{+}}\) \(\color{green}{\texttt{+2}}\) \(\color{green}{\texttt{+3}}\) \(\color{red}{\texttt{+1}}\) \(
阅读全文
摘要：Flash Nautilus Valley Kitchen Necklace Olympiads \(\color{green}{\texttt{-}}\) \(\color{green}{\texttt{+}}\) \(\color{green}{\texttt{+}}\) \(\color{gr
阅读全文
摘要：books servers watchmen prison swaps xanadu \(\color{green}{\texttt{+8}}\) \(\color{green}{\texttt{+2}}\) \(\color{green}{\texttt{-}}\) \(\color{green}
阅读全文
摘要：不想写题了，就做个总结吧。 大部分都是小清新题，码量极小 感觉整理下来也没有多少道题 来源比较混乱，主要是 Gym 的题 Mr. Panda and Cactus 题解 * 哈夫曼树，构造 Non-Maximum Suppression 题解 * ~~信仰~~，二维分块，结论 Evacuation
阅读全文
摘要：链接 题目大意 给定一个无向图，每条边有正边权，每个点有点权 \(w_i\)。有一些点被标记。假设某一天能见度为 \(r_i\)，那么定义一个点 \(u\) 的危险度就是 \(\sum{[\ v\text{被标记}\ ]\ [\ dis(v,u)\leq r_i\ ]}\)。 如果一个点的危险度小于
阅读全文
摘要：链接 题目大意 给定 \(m\) 个区间，有 \(n\) 次询问，每次给定 \(k_i\) 个点(\(\sum{k_i}\leq 10^5\))，问 \(m\) 区间 \([l_j,r_j]\) 中，将区间中的所有点排序后 \(r_j-l_j+\sum{i\times a_i}\) 的最大值（将未被
阅读全文
