CygneNoir

# 单链表 #include <iostream> using namespace std; const int N = 1e6 + 10; int head, e[N], ne[N], idx; void init(){ head = -1; idx = 0; } void add_to_head(int x){ e[idx] = x, ne[idx] = head, head = idx, idx++; } void add(int k, int x){

# 差分矩阵 #include <iostream> using namespace std; const int N = 1010; int n, m, q; int a[N][N], b[N][N]; void insert(int x1, int y1, int x2, int y2, int c){ b[x1][y1] += c; b[x2 + 1][y1] -= c; b[x1][y2 + 1] -= c; b[x2 + 1][y2 + 1] += c; } in

# 差分 #include <iostream> using namespace std; const int N = 1e6 + 10; int n, m; int a[N], b[N]; void insert(int l, int r, int c){ b[l] += c; b[r + 1] -= c; } int main(){ scanf("%d%d", &n, &m); for(int i = 1; i <= n

# 最长连续不重复 - 双指针 #include <iostream> const int N = 1e6 + 10; int n; int a[N], s[N]; using namespace std; int main(){ cin >> n; for(int i = 0; i < n; i++) cin >> a[i]; int res = 0; for(int i = 0, j = 0; i < n; i++){ s[a[i]]++; whil

# 子矩阵的和 - 二维前缀和 #include <iostream> const int N = 1010; int n, m, q; int a[N][N], s[N][N]; int main(){ scanf("%d%d%d", &n, &m, &q); for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) scanf("%d&qu

# 高精度减法 #include <iostream> #include <vector> using namespace std; const int N = 1e6 + 10; bool cmp(vector<int> &A, vector<int> &B){ if(A.size() != B.size()) return A.size() > B.size(); for(int i = A.size() - 1; i >= 0; i--){

# 高精度乘法 #include <iostream> #include <vector> using namespace std; vector<int> mul(vector<int> &A, int b){ vector<int> C; int t = 0; for(int i = 0; i < A.size() || t; i++){ if(i < A.size()) t += A[i] * b; C.push_back(t % 10);

# 高精度除法 #include <iostream> #include <vector> #include <algorithm> using namespace std; vector<int> div(vector<int> &A, int b, int &r){ vector<int> C; r = 0; //由于形参是引用地址所以 r = 0 可有可无 for(int i = A.size() -1; i >=

# 前缀和 #include <iostream> using namespace std; const int N = 1e6 + 10; int n, m; int a[N], s[N]; int main(){ scanf("%d%d", &n, &m); for(int i = 1; i <= n; i++) scanf("%d", &a[i]); for(int i = 1; i <= n; i++) s[i] =

# 快速排序 #include <iostream> using namespace std; const int N = 1e6 + 10; int n; int q[N]; void quick_sort(int l, int r){ if(l >= r) return; int x = q[(l + r) / 2], i = l - 1, j = r + 1; while(i < j){ do i++; while(q[i] < x); do j--; w