摘要:
线段树 1.区间加和区间查询 cpp include include include using namespace std; int n; long long ans(); int main() { int t; scanf("%d",&t); for(int i=1;i正质因数个数为$\delt 阅读全文
摘要:
传送门 I: "Can you answer these queries I" II: "Can you answer these queries II" III: "Can you answer these queries III" IV: "Can you answer these querie 阅读全文
摘要:
传送门: "洛谷 P4392 Sound 静音问题" 题目描述: 求数组区间最大(小) 算法分析:模板即可(然而调了半个小时——~~取最小值的时候忘记取最大值了QWQ~~) cpp include include include define maxN 1000010 define ls k 1) 阅读全文