qq_35752161的博客

//lower_bound，即>=target实现。跳出循环时，l==r int l = 0, r = nums.size(); while (l < r) { int m = (l + r) >> 1; if (nums[m] < target) l = m + 1; else r = m; } //upper_bound，即> target实现。取边界l l = 0, r = nums.size() - 1; while (l <= r) {.

配合https://www.bilibili.com/video/av47331849食用 #include<bits/stdc++.h> using namespace std; #define maxn 100000 void build_tree(int arr[], int tree[], int node, int start, int end) { if (start == end) { tree[node] = arr[start]; return; } .

模板是这样的???? const int maxn = 100000; int head[maxn], Next[maxn], to[maxn], edge[maxn],cnt; void add(int u, int v, int w) { Next[++cnt] = head[u]; to[cnt] = v; head[u] = cnt; edge[cnt] = w; } int main(){ int m,n,w; scanf("%d%d", &m, &n); for (