摘要：
求树的直径。 两遍$dfs$就好了。 cpp include include include include include const int maxn = 10000; const int maxm = 10000; using namespace std; int to[(maxn + max 阅读全文
摘要：
模拟题。 良心出题人并没有$y_1 y_2$的样例。注意闰年的处理。 cpp include using namespace std; int dayOfMonth[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; bool isL 阅读全文