不慌不忙、不急不躁

题目链接：hysbz 2243 染色题目大意：略。解题思路：树链剖分+线段树的区间合并，但是区间合并比较简单，节点只要记录左右端点的颜色即可。#include #include #include using namespace std;const int maxn = 1e5 + 5;int N, M, ne, val[maxn], first[maxn], j

题目链接：hysbz 1036 树的统计Count题目大意：略。解题思路：树链剖分+线段树维护。#include #include #include using namespace std;const int maxn = 30005;const int INF = 0x3f3f3f3f;#define lson(x) ((x)#define rson(x)

题目链接：hysbz 2038 小Z的袜子代码#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 50005;struct State { int l, r, id;}Q[ma