摘要:
#include <bits/stdc++.h> #define int long long using namespace std; const int N = 1e5 + 10; int n, m; int w[N]; struct Node { int l, r; int tag, sum; 阅读全文
posted @ 2022-02-12 18:26
Angels_of_Death
阅读(30)
评论(0)
推荐(0)
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m; int a[N]; struct Node { int l, r; int sum, lmax, rmax, tmax; }tr[N * 4 阅读全文
posted @ 2022-02-12 17:23
Angels_of_Death
阅读(25)
评论(0)
推荐(0)
摘要:
dfs序 + 状态压缩 + 线段树 #include <bits/stdc++.h> #define LL long long using namespace std; const int N = 4e5 + 10, M = N * 2; int n, m; int w[N], h[N], e[M] 阅读全文
posted @ 2022-02-12 11:31
Angels_of_Death
阅读(42)
评论(0)
推荐(0)