You are given a program you want to execute as a set of tasks organized in a dependency graph. The dependency graph is a directed acyclic graph: each task can depend on results of one or several other tasks, and there are no directed circular depende…
题解. 贪心,拓扑排序. 和拓扑排序一样,先把$flag$为$0$的点能删的都删光,露出来的肯定都是$flag$为$0$的,然后疯狂删$flag$为$0$的,这些会使答案加$1$,反复操作就可以了. #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n, m; int f[maxn], in[maxn]; int h[maxn], to[maxn], nx[maxn]; void add(i…
题目: 给n个数字,一段合法区间[l,l+m-1]要求max-min<=c 输出所有合法区间的左端点,如果没有输出NONE 题解: 单调队列同时维护最大值和最小值 #include<cstdio> #include<algorithm> #include<cstring> #define N 1000005 using namespace std; int n,m,c,Q[N],q[N],a[N],Ql,Qr,ql,qr,OK; int main() { scan…