![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
拓扑排序
newhonor
可以不伟大,但不能卑微
展开
-
D. Gourmet choice
http://codeforces.com/contest/1131/problem/D题意:给n*m的字符矩阵,表示两组数分别由n个数组成的数组A和m个数组成的数组B,aij是‘>’表示A中第i个数比B中第j个数大,'<'则相反,‘=’则两数相等;问是否有两数组能用字符矩阵表示,有则输出两数组中最大的数最小的数组;思路:并查集+拓扑排序;把相等的用并查集缩点,再把小的向大连...原创 2019-02-25 21:12:48 · 371 阅读 · 0 评论 -
J. Kitchen Plates
https://codeforc.es/gym/102219/problem/J思路:连边,拓扑排序;#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>#include<set>#includ...原创 2019-07-08 11:08:15 · 343 阅读 · 0 评论 -
F. Tree Restoration
http://codeforces.com/gym/101755/problem/F#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-10-02 16:54:15 · 174 阅读 · 0 评论