#include<cstdio>
#include<algorithm>
#define foru(i,a,b) for(int i=a;i<=b;i++)
#define sd(a) scanf("%d",&a)
using namespace std;
typedef long long ll;
const int N=1e5+5,M=N*100,INF=0x3f3f3f3f;
struct Edge{
int to,nex,k;}edge[M];
int head[N],fin[N],maxk,
L2-026 小字辈(dfs)
最新推荐文章于 2020-09-09 20:52:15 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)