图论
信鸦
这个作者很懒,什么都没留下…
展开
-
HDU 5253 连接的管道(最小生成树)
连接的管道Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3254 Accepted Submission(s): 1085Problem Description老 Jack 有一片农田,以往几年都是靠原创 2017-04-13 22:34:00 · 317 阅读 · 0 评论 -
HYSBZ 1191HYSBZ 1191(二分图最大匹配裸题)
1191: [HNOI2006]超级英雄HeroTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 4717 Solved: 2155[Submit][Status][Discuss]Description现在电视台有一种节目叫做超级英雄,大概的流程就是每位选手到台上回答主持人的几个问题,然后根据回答问题的多少获得不同数目的奖品原创 2017-08-03 17:12:32 · 295 阅读 · 0 评论 -
POJ 2330 Watchcow(欧拉回路)
WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8249 Accepted: 3589 Special JudgeDescriptionBessie's been appointed the new watch-cow for th原创 2017-08-05 15:36:02 · 309 阅读 · 0 评论 -
HDU 1878 欧拉回路(入门)
欧拉回路Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15305 Accepted Submission(s): 5855Problem Description欧拉回路是指不令笔离开纸面,可画过图中每原创 2017-08-05 15:50:48 · 416 阅读 · 0 评论 -
Hrbust 2310 Tree Painting(欧拉路径性质)
Tree PaintingTime Limit: 1000 MSMemory Limit: 131072 KTotal Submit: 42(22 users)Total Accepted: 19(16 users)Rating: Special Judge: NoDescription原创 2017-08-05 15:58:23 · 410 阅读 · 0 评论 -
个人模板 拓扑排序
#include using namespace std;int n, m;int a[101][101], d[101];void topo(){ for(int i = 1; i <= m; i++){ for(int j = 1; j <= m; j++){ if(!d[j]){ d[j]--;原创 2017-08-07 17:12:07 · 485 阅读 · 0 评论