随笔分类 -  01.图论 - (5)二分图

摘要:题目链接:https://cn.vjudge.net/problem/HDU-2819 Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you 阅读全文
posted @ 2017-10-20 22:22 Dilthey 阅读(356) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5727 Problem DescriptionSJX has 2*N magic gems. N of them have Yin energy inside while others hav 阅读全文
posted @ 2017-10-18 22:16 Dilthey 阅读(279) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1281 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Des 阅读全文
posted @ 2017-10-13 20:24 Dilthey 阅读(307) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1083 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem D 阅读全文
posted @ 2017-10-13 19:18 Dilthey 阅读(206) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2444 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Des 阅读全文
posted @ 2017-10-12 23:08 Dilthey 阅读(279) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1045 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Des 阅读全文
posted @ 2017-10-10 21:19 Dilthey 阅读(534) 评论(0) 推荐(0) 编辑
摘要:题目链接:https://cn.vjudge.net/problem/HDU-1565 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 给你一个 阅读全文
posted @ 2017-10-03 00:01 Dilthey 阅读(448) 评论(0) 推荐(0) 编辑
摘要:嗯,这是关于最大点权独立集与最小点权覆盖集的姿势,很简单对吧,然后开始看题。 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1569 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536 阅读全文
posted @ 2017-08-20 21:37 Dilthey 阅读(995) 评论(2) 推荐(0) 编辑

点击右上角即可分享
微信分享提示