随笔分类 - 知识
知识
    
摘要:```cpp struct Sgt{ int lazyTag; int val; }t[maxn]; void pushUp(int x, int l, int r){ t[x].val = t[x].lazyTag * (r - l + 1) + t[x * 2].val + t[x * 2 + 
        阅读全文
                
摘要:```cpp struct Node { int pri, data, num, sz, ch[2], fa; }t[maxn]; int pos; struct Treap { int root; int newNode(int x) { t[++ pos] = (Node){rand(), x,
        阅读全文
                
摘要:有关数据 | $\texttt{Time Limit}$ | $\texttt{Memory Limit}$ | $\texttt{Difficulty}$ | | | | | | $\color{green}{\texttt{1 sec}}$ | $\color{red}{\texttt{3000
        阅读全文
                
摘要:ABC 293 G 题题解 —— 莫队
        阅读全文
                

浙公网安备 33010602011771号