剑不飞

2013年7月22日

hdu 4360 As long as Binbin loves Sangsang(最短路拆点，5级)

摘要： A -As long as Binbin loves SangsangTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4360DescriptionBinbin misses Sangsang so much. He wants to meet with Sangsang as soon as possible. Now Binbin downloads a map from ELGOOG.There are N (1’O’->’V’->’E’ 阅读全文

posted @ 2013-07-22 09:19 剑不飞阅读(426) 评论(0) 推荐(0)

2013年7月21日

各类算法题目收集

摘要： -----------------------------最优化问题------------------------------------- ----------------------常规动态规划 SOJ1162 I-Keyboard SOJ1685 Chopsticks SOJ1679 Gangsters SOJ2096 Maximum Submatrix SOJ2111 littleken bg SOJ2142 Cow Exhibition SOJ2505 The County Fair SOJ2818 QQ音速 SOJ2469 Exploring Pyramids SOJ1833 B 阅读全文

posted @ 2013-07-21 14:51 剑不飞阅读(520) 评论(0) 推荐(0)

2013年7月20日

hdu 4354 Missile(中心区间枚举+树形DP判断，5级)

摘要： E -MissileTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4354DescriptionLong long ago,there is a strange area where all the C cities are located in a straight line.To make things easy,lets regard the line as X axis.Even more strangely,cities belonging t 阅读全文

posted @ 2013-07-20 16:51 剑不飞阅读(196) 评论(0) 推荐(0)

hdu 4352 XHXJ's LIS(dp,压缩版递增序列，5级)

摘要： C -XHXJ's LISTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4352Description#define xhxj (Xin Hang senior sister(学姐))If you do not know xhxj, then carefully reading the entire description is very important.As the strongest fighting force in UESTC, xh 阅读全文

posted @ 2013-07-20 15:31 剑不飞阅读(198) 评论(0) 推荐(0)

hdu 4335 Party All the Time(三分求极值，3级)

摘要： Party All the TimeTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2161Accepted Submission(s): 732Problem DescriptionIn the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there 阅读全文

posted @ 2013-07-20 10:26 剑不飞阅读(182) 评论(0) 推荐(0)

hdu 4357 String change(推理题，4级)

摘要： String changeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 802Accepted Submission(s): 370Problem DescriptionIn this problem you will receive two strings S1and S2that contain only lowercase letters.Each time you can swap any two characters of S1. 阅读全文

posted @ 2013-07-20 10:20 剑不飞阅读(200) 评论(0) 推荐(0)

hdu 4350 Card(递推循环节，3级)

摘要： 2013暑期多校联合训练——80+高校，300+队伍，10000元奖金，敬请期待~CardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 889Accepted Submission(s): 517Problem DescriptionBearchild is playing a card game with himself. But first of all, he needs to shuffle the cards. His strate 阅读全文

posted @ 2013-07-20 10:16 剑不飞阅读(151) 评论(0) 推荐(0)

2012 Multi-University Training Contest 6

摘要：附：官方题解：、阅读全文

posted @ 2013-07-20 10:10 剑不飞阅读(134) 评论(0) 推荐(0)

2013年7月19日

HDU 1068 Girls and Boys(二分图最大独立点集,3级)

摘要： Girls and BoysTime Limit:10000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl 阅读全文

posted @ 2013-07-19 16:47 剑不飞阅读(209) 评论(0) 推荐(0)

2013年7月15日

hdu 2063 过山车（二分图最大匹配，2级）

摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6952Accepted Submission(s): 3020Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只阅读全文

posted @ 2013-07-15 19:18 剑不飞阅读(147) 评论(0) 推荐(0)

公告