摘要:
咕咕 阅读全文
摘要:
建树 老姚式建树(期望深度:log(n)) #include<bits/stdc++.h> using namespace std; int main(){ srand(time(0));srand(rand()); int n=100; printf("%d\n",n); for(int i=2; 阅读全文
摘要:
![](https://img2020.cnblogs.com/blog/1997100/202010/1997100-20201026173526804-1187906077.png) 阅读全文