应该是并查集出现了环，导致栈内存先于时限卡爆了吧
比如说这段代码就会mle
```c++
#include<bits/stdc++.h>
using namespace std;
int fa[100];
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
int main() {
fa[1] = 2;
fa[2] = 1;
printf("%d\n", Find(1));
return 0;
}
```
by FDsama @ 2024-03-14 15:27:18