模板
文章平均质量分 85
Jelly_acm
这个作者很懒,什么都没留下…
展开
-
Hdu2389 Rain on your Parade (HK二分图最大匹配)
Rain on your ParadeProblem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a sooth原创 2017-06-30 14:51:39 · 523 阅读 · 0 评论 -
HDU2222 Keywords Search(AC自动机)
Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 68126 Accepted Submission(s): 22973Problem DescriptionIn t原创 2017-09-18 21:54:59 · 530 阅读 · 0 评论 -
HDU2089 不要62(数位dp)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46025 Accepted Submission(s): 17376Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音原创 2017-09-10 22:12:41 · 264 阅读 · 0 评论 -
POJ2914 Minimum Cut(最小割)
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9715 Accepted: 4085Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi原创 2017-08-05 14:47:36 · 544 阅读 · 0 评论 -
UVA315 Network(tarjan求割点)
NetworkA Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same number. Th原创 2017-07-21 16:36:52 · 376 阅读 · 0 评论 -
HDU5934 Bomb(强连通缩点)
Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2017-07-21 16:18:09 · 404 阅读 · 0 评论 -
POJ1273&&Hdu1532 Drainage Ditches(最大流dinic)
Drainage DitchesProblem DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built原创 2017-02-11 16:28:03 · 154 阅读 · 0 评论 -
POJ2536 Gopher II(二分图最大匹配)
Gopher IITime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9005 Accepted: 3724DescriptionThe gopher family, having averted the canine threat, must face a原创 2017-06-29 15:03:50 · 394 阅读 · 0 评论 -
URAL1099. Work Scheduling(一般图匹配带花树开花算法)
1099. Work SchedulingTime limit: 0.5 secondMemory limit: 64 MBThere is certain amount of night guards that are available to protect the local junkyard from possible junk robberies. These原创 2017-07-04 21:34:44 · 536 阅读 · 0 评论 -
Hdu2255 奔小康赚大钱(二分图最大权匹配KM算法)
奔小康赚大钱Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外的村领导希望得到最大的效益,原创 2017-07-04 16:47:06 · 291 阅读 · 0 评论 -
HDU3062 Party (2-sat)
PartyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7029 Accepted Submission(s): 2299Problem Description有n对夫妻被邀请参加一个聚会,因为场地的问题,每对夫妻中只有1人可以列原创 2017-10-09 21:09:46 · 404 阅读 · 0 评论