摘要: #include<cstdio> using namespace std; long long a[1000010]; int n,k; struct node { long long w,num; }q[1000010]; void search_min() { int end=0,head=1; 阅读全文
posted @ 2021-11-07 22:05 ZeroHzzzz 阅读(7) 评论(0) 推荐(0)
摘要: #include<cstdio> using namespace std; const int maxn=200010; int head[maxn],nxt[maxn],to[maxn],tt; int low[maxn],dfn[maxn],index; int n,m; bool cut[ma 阅读全文
posted @ 2021-11-07 22:03 ZeroHzzzz 阅读(8) 评论(0) 推荐(0)
摘要: #include<cstdio> #include<queue> using namespace std; queue<int>q; int head[1000010],nxt[1000010],w[1000010],to[1000010],tot; int dis[500010],vis[5000 阅读全文
posted @ 2021-11-07 22:00 ZeroHzzzz 阅读(9) 评论(0) 推荐(0)
摘要: #include<cstdio> #include<stack> #include<map> using namespace std; const int maxn=50010; stack<int>q; int head[maxn],nxt[maxn],to[maxn],tt; int dfn[m 阅读全文
posted @ 2021-11-07 19:35 ZeroHzzzz 阅读(7) 评论(0) 推荐(0)