Codeforces Round #656 (Div. 3) 解题报告(ABCDE)

Codeforces 1385A - Three Pairwise Maximums(思维)
Codeforces 1385B - Restore the Permutation by Merger(思维)
Codeforces 1385C - Make It Good(思维)
Codeforces 1385D - a-Good String(分治 + 贪心)
Codeforces 1385E - Directing Edges(拓扑排序判环)

比赛的时候写出来了3个,D题最后想到递归去做但是时间不够用了,这次比赛学到了分治法和E题的拓扑排序,判环,根据拓扑关系处理先后顺序之类的,赛后补题DE。收获蛮大

猜你喜欢

转载自blog.csdn.net/aezakmias/article/details/107435329