![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
-------拓扑
文章平均质量分 70
猿的进化之路
这个作者很懒,什么都没留下…
展开
-
拓扑
#include #include #define Max 105#include using namespace std;queue que;int xd[Max][Max];int din[Max];int main(){ int M,n; int s,d; while(cin>>M>>n) { while(!que.empty原创 2015-08-17 08:28:24 · 370 阅读 · 0 评论 -
hdu2647
拓扑 水题http://acm.hdu.edu.cn/showproblem.php?pid=2647RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5773 Accepted Subm原创 2015-08-18 09:10:01 · 341 阅读 · 0 评论 -
hdu1285
http://acm.hdu.edu.cn/showproblem.php?pid=1285确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17556 Accepted Subm原创 2015-08-18 09:13:00 · 346 阅读 · 0 评论 -
hdu4109拓扑
http://acm.hdu.edu.cn/showproblem.php?pid=4109Instrction ArrangementTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1320 Accept原创 2015-08-19 10:29:03 · 449 阅读 · 0 评论 -
图论训练1A,uva4255 拓扑排序
Given a sequence of integers, a1, a2,..., an , we define its sign matrix S such that, for 1ijn , Sij = `` + " if ai +...+ aj > 0 ; Sij = `` - " ifai +...+ aj ; and Sij = ``0" otherwise.For ex原创 2016-03-16 21:52:11 · 442 阅读 · 0 评论 -
hdu5813
Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 401 Accepted Submission(s): 202Special JudgeProblem Descripti原创 2016-08-10 10:45:34 · 351 阅读 · 0 评论 -
hdu4948 拓扑删除
KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 609 Accepted Submission(s): 275Special JudgeProblem DescriptionTeacher原创 2016-09-17 10:35:34 · 352 阅读 · 0 评论 -
Gym 100917A 类似拓扑 的好题
A - Abstract PictureTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice Gym 100917ADescriptionstandard input/outputStatements原创 2016-10-03 10:37:23 · 415 阅读 · 0 评论 -
hdu6073二分图完美匹配之权值之积再求和
传送门 题意:给一个二分图,一个完美匹配的权值等于完美匹配的边的权值的乘积,求所有完美匹配权值的和,保证至少有一个完美匹配。 眼里解释:第一行为T,T组数据,然后一行为n,表示有二分图每个集合有n个点, 然后下面有n行,每行四个数,例如第i行的四个数,v1,w1,v2,w2,那么就表示 i 与v1相连,权值为w1,i与v2相连,权值为w2。即左边集合就是i,(1<=i<=n),右边集合为输入的原创 2017-08-09 14:59:27 · 389 阅读 · 0 评论