摘要:
C - Rooks Defenders 线段树模板,维护:1)v:个数 , 2)sum:v的个数是否大于0. // #include"bits/stdc++.h" #include"iostream" using namespace std; const int N = 2e5; struct No 阅读全文
摘要:
https://zhuanlan.zhihu.com/p/426906301 self[index[i][j][k]][j][k] = src[i][j][k] # if dim == 0 self[i][index[i][j][k]][k] = src[i][j][k] # if dim == 1 阅读全文