• 等级
  • 83050 访问
  • 176 原创
  • 2 转发
  • 24260 排名
  • 35 评论
  • 20 获赞

HDU 5956 The Elder(树上斜率优化DP)

TheElderTimeLimit:8000/4000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):1098AcceptedSubmission(s):289ProblemDescriptionOnceuponatime,inthemysti

2017-11-28 22:01:10

HDU 5952 Counting Cliques(无向图定向搜索)

CountingCliquesTimeLimit:8000/4000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):3480AcceptedSubmission(s):1254ProblemDescriptionAcliqueisacomplete

2017-11-21 21:37:11

ZOJ 3981 Balloon Robot(提前位置取消等待时间)

BalloonRobotTimeLimit:1SecondMemoryLimit:65536KBThe2017ChinaCollegiateProgrammingContestQinhuangdaoSiteiscoming!Therewillbeteamsparticipatinginthecontest,andthecon

2017-10-30 12:21:10

HDU 5936 Difference(折半枚举)

DifferenceTimeLimit:6000/3000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):1247AcceptedSubmission(s):335ProblemDescriptionLittleRuinsisplayinganum

2017-10-28 15:49:42

51Nod 1110 距离之和最小 V3(中位数+权值转化为个数)

基准时间限制:1秒空间限制:131072KB分值:40难度:4级算法题X轴上有N个点,每个点除了包括一个位置数据X[i],还包括一个权值W[i]。点P到点P[i]的带权距离=实际距离*P[i]的权值。求X轴上一点使它到这N个点的带权距离之和最小,输出这个最小的带权距离之和。Input第1行:点的数量N。(2<=N<=10000)第2-N+1行:每行

2017-10-25 17:57:19

Codeforces 274D Lovely Matrix(拓扑排序+建图)

D.LovelyMatrixtimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputLennyhadann × mmatrixofpositiveintegers.Helovedthematrixsomu

2017-10-25 16:30:57

Codeforces 873B Balanced Substring(利用前缀和找和为0的子串)

B.BalancedSubstringtimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputYouaregivenastringsconsistingonlyofcharacters0and1.Asub

2017-10-18 15:02:24

HDU 5917 Instability(Ramsey定理)

InstabilityTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):592AcceptedSubmission(s):218ProblemDescriptionLonglongago,therewasapr

2017-10-17 09:41:48

51Nod 1499 图(最小割+边在割的一边有收益建图)

1499图基准时间限制:2秒空间限制:262144KB分值:80难度:5级算法题给一个无向图,你要将这些点分成A、B两个集合,使得满足A的导出子图是一个完全图,而B的导出子图是一个没有边的图。但是事实上你不一定能够做到,所以你允许有错误。我们定义一个完美值为:1.如果A中两点有边相连,则增加|i-j|的完美值。2.如果B中两点无边相连,则增加|i-j|的完美值。

2017-10-15 13:16:16

Codeforces 808F Card Game(和是素数二分图建图+二分图带权最大独立集)

F.CardGametimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputDigitalcollectiblecardgameshavebecomeverypopularrecently.SoVovadec

2017-10-13 12:04:42

Codeforces 808E Selling Souvenirs(花费是倍数关系的背包)

E.SellingSouvenirstimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputAfterseverallatestreformsmanytouristsareplanningtovisitBerl

2017-10-13 09:36:07

HihoCoder 1252 Kejin Game(最小割+点在割的一侧有花费建图)

NowadaysalotofKejingames(thegameswhicharefreetogetandplay,butsomeitemsorcharactersareunavailableunlessyoupayforit)appeared.Forexample,LoveLive,Kankore,Puzzle&Dragon,

2017-10-08 20:16:09

Codeforces 804D Expected diameter of a tree(树的直径)

F.Expecteddiameterofatreetimelimitpertest3secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputPashaisagoodstudentandoneofMoJaK’sbestfriends.He

2017-10-07 23:16:16

Codeforces 813D Two Melodies(维护转移来源的DP)

D.TwoMelodiestimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputAliceisabeginnercomposerandnowsheisreadytocreateanothermaster

2017-10-05 14:32:53

Codeforces 864F Cities Excursions(离线处理+Tarjan)

F.CitiesExcursionstimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputTherearencitiesinBerland.Somepairsofthemareconnectedwith

2017-10-01 22:57:52

HDU 5556 Land of Farms(枚举+二分图匹配)

LandofFarmsTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):526AcceptedSubmission(s):174ProblemDescriptionFarmerJohnandhisbroth

2017-10-01 16:22:16

POJ 3728 The merchant(LCA+DP)

ThemerchantTimeLimit:3000MSMemoryLimit:65536KTotalSubmissions:5160Accepted:1776DescriptionThereareNcitiesinacountry,andthereisoneandonlyonesimplepathbetweeneac

2017-09-18 15:09:09

HDU 6196 happy happy happy(卡时剪枝)

happyhappyhappyTimeLimit:6000/3000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):299AcceptedSubmission(s):86ProblemDescriptionToday,Bobplayswitha

2017-09-12 15:56:57

POJ 1991 Turning in Homework(由大推小的区间DP)

TurninginHomeworkTimeLimit:1000MSMemoryLimit:30000KTotalSubmissions:1172Accepted:519DescriptionBessiemustturninherhomeworkforherCclasses(1<=C<=1,000)atMooUso

2017-09-09 21:15:55

2017乌鲁木齐赛区网络赛 I Colored Graph(完全图边定向构造)

I:ColoredGraphtimelimit1000msmemorylimit131072KBIngraphtheory,graphcolouringisaspecialcaseofgraphlabelling.Itisanassignmentoflabelstraditionallycalledcolourstoedges

2017-09-09 18:26:32

Yasola

ACMer
关注
  • 计算机软件/学生
  • 中国 湖北省 武汉市