while_you的博客

2019 ICPC 银川 K.Largest Common Submatrix悬线法参考

Link前置线段树的RMQ模板（区间查询，区间修改）int tree[maxn],lazy[maxn];void push_up(int u){ int v1=u*2,v2=u*2+1; tree[u]=max(tree[v1],tree[v2]);}void push_down(int u){ int v1=u*2,v2=u*2+1; tree[v1]+=lazy[u]; tree[v2]+=lazy[u]; lazy[v1]+=lazy[u]; lazy[v2]+=lazy[u