随笔分类 - 数据结构-一维线段树&二维线段树
摘要：Given a integers x = 1, you have to apply Q (Q ≤ 100000) operations: Multiply, Divide. Input First line of the input file contains an integer T(0 incl
阅读全文
摘要：给你一个n个初始元素都为1的序列和m个询问q。 询问格式为：l r x(x为2or3) 最后求1~n所有数的GCD GCD：把每个数分别分解质因数，再把各数中的全部 公有质因数 提取出来连乘，所得的积就是这几个数的最大公约数。 include include include include incl
阅读全文
摘要：http://acm.csu.edu.cn/csuoj/problemset/problem?pid=2151 Input 第一行三个数n,m,v0 表示有n名萌新和m次调整，初始时全部萌新的集训难度都为v0 第2~m+1行 每行三个数或四个数 0 x y v 表示把 [x,y]区间内的萌新的集训难
阅读全文
摘要：【例题】 一、单点更新 #include<cstdio> #include<string> #include<cstdlib> #include<cmath> #include<iostream> #include<cstring> #include<set> #include<queue> #in
阅读全文
摘要：``` include include include include include include include include include include include include include include include include define debug() put
阅读全文
摘要：Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 62103 Accepted: 29005 Case Time Limit: 2000MS Description For the daily mil
阅读全文
