随笔分类 -  图论

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudhttps://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3933给你... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudMZL's endless loopTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Tot... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudApple TransportationTime Limit:1 Second Memory Limit:32768 KBThere's a big apple tree in the forest. I... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudMarriage Match IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total ... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudWarTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s):... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudSequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submissio... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudSystem AdministratorBob got a job as a system administrator in X corporation. His first task was to co... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudMissile SilosA country called Berland consists of n cities, numbered with integer numbers from 1 to n.... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudCandiesTime Limit: 1500MSMemory Limit: 131072KDescriptionDuring the kindergarten days, flymouse was th... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudInteger IntervalsTime Limit: 1000MSMemory Limit: 10000KDescriptionAn integer interval [a,b], a 2 #inc... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudIntervalsTime Limit: 10 Seconds Memory Limit: 32768 KBYou are given n closed, integer intervals [ai... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudInvitation CardsTime Limit: 5 Seconds Memory Limit: 65536 KBIn the age of television, not many peop... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraud题意：一商店二十四小时营业，但每个时间段需求的出纳员不同，现有n个人申请这份工作，其可以从固定时间t连续工作八个小时，问在满足需求的情况下最小需要多少个出纳一道十分经典的差分约束题目，在构图上稍有难度为避... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudRemmarguts' DateTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 21855Accepted: 5958Descriptio... 阅读全文

摘要：转载请注明出处：http://www.cnblogs.com/fraud/ ——by fraudGoing from u to v or from v to u?Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 14778Accepte... 阅读全文