2020年4月18日
Codeforces Round #612 (Div. 1+Div. 2)
摘要： A 找一个除去开头外的最长连续$P$段即可。 D 无解的情况比较显然：当子树$i$中的点的个数$ include include include include include include include include include include include using namespa 阅读全文
posted @ 2020-04-18 00:10 EncodeTalker 阅读(184) 评论(0) 推荐(0) 编辑