2022年1月30日
维护序列
摘要： 维护序列 代码 #include<iostream> #define MAXN 100005 #define ll long long using namespace std; int n, m, mod,k; int a[MAXN]; struct Tree { ll sum, add, mul; 阅读全文
posted @ 2022-01-30 16:33 Lewis_1231 阅读(58) 评论(0) 推荐(0)
A Simple Problem with Integers
摘要： A Simple Problem with Integers 代码 #include<iostream> using namespace std; const int MAXN=100005; long long a[MAXN]; long long lazy[MAXN<<2]; struct tr 阅读全文
posted @ 2022-01-30 16:27 Lewis_1231 阅读(25) 评论(0) 推荐(0)
Can you answer these queries III？
摘要： Can you answer these queries III？ 代码 #include<iostream> #define max(a,b) ((a)>(b))?(a):(b) using namespace std; const int maxn = 100005; int n, m, x, 阅读全文
posted @ 2022-01-30 16:24 Lewis_1231 阅读(39) 评论(0) 推荐(0)
Can you answer these queries 1?
摘要： Can you answer these queries 1? 代码 #include<iostream> #include<algorithm> #include<cstdio> using namespace std; const int M = 1e5 + 5; int m, n, len, 阅读全文
posted @ 2022-01-30 16:21 Lewis_1231 阅读(26) 评论(0) 推荐(0)