悔惜晟

<br />#include <algorithm> #include <cstdio> #include <iostream> #include <queue> #include <cstring> using namespace std; const int N = 205; struct Node{ int c, end; int next; } E[2 * N]; int pre[N]; // 记录前驱 int head[N]; int path[N]; // 记录