11 2013 档案

一些激励人的话 ——记东华大学校ACM/ICPC集训队
摘要：一些激励人的话写的蛮有趣于无声处听惊雷——记东华大学校ACM/ICPC集训队信息学院二楼尽头一间普普通通的小机房，你会发现，每一个夜晚，这里都会有清晰的键盘敲击声音和时时的讨论声音传出。走近这里，我们会发现这里的灯光会经常的彻夜长明。甚至东方已晓，这里的学生会依然沉浸于他们的世界而不知时间流逝。他们... 阅读全文
posted @ 2013-11-25 21:23 炒饭君 阅读(512) 评论(0) 推荐(0)
HDU 3525 Orienteering (最长公共子串转化为最长上升子序列)
摘要：OrienteeringProblem DescriptionThe Orienteering competition is coming soon！Now there are N players to participate in，each has his own cheering squad (... 阅读全文
posted @ 2013-11-22 17:01 炒饭君 阅读(236) 评论(0) 推荐(0)
HDU 2199 Can you solve this equation? (二分 水题)
摘要：Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6023Accepted Submissio... 阅读全文
posted @ 2013-11-19 22:29 炒饭君 阅读(125) 评论(0) 推荐(0)
Google Code Jam 2009, Round 1C C. Bribe the Prisoners (记忆化dp)
摘要：ProblemIn a kingdom there are prison cells (numbered 1 toP) built to form a straight line segment. Cells numberiandi+1are adjacent, and prisoners in a... 阅读全文
posted @ 2013-11-16 21:09 炒饭君 阅读(219) 评论(0) 推荐(0)
POJ 1830 开关问题 (高斯消元)
摘要：开关问题Time Limit:1000MSMemory Limit:30000KTotal Submissions:4937Accepted:1801Description有N个相同的开关，每个开关都与某些开关有着联系，每当你打开或者关闭某个开关的时候，其他的与此开关相关联的开关也会相应地发生变化，... 阅读全文
posted @ 2013-11-14 22:22 炒饭君 阅读(138) 评论(0) 推荐(0)
LA 3516 - Exploring Pyramids (记忆化搜索dp)
摘要：Archaeologists have discovered a new set of hidden caves in one of the Egyptian pyramids. The decryption of ancient hieroglyphs on the walls nearby sh... 阅读全文
posted @ 2013-11-12 14:33 炒饭君 阅读(173) 评论(0) 推荐(0)
UVA 11174 - Stand in a Line (数学基础+除法取模)
摘要：Problem JStand in a Line Input: Standard InputOutput: Standard Output All the people in the byteland want to stand in a line in such a way that nopers... 阅读全文
posted @ 2013-11-12 13:45 炒饭君 阅读(238) 评论(0) 推荐(0)
POJ 3616 Milking Time
摘要：Milking TimeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3852Accepted: 1623DescriptionBessie is such a hard-working cow. In fact, she is... 阅读全文
posted @ 2013-11-04 20:06 炒饭君 阅读(118) 评论(0) 推荐(0)
UVA 11375 - Matches
摘要：Problem E: MatchesWe can make digits with matches as shown below: Given N matches, find the number of different numbers representable using the matche... 阅读全文
posted @ 2013-11-04 00:07 炒饭君 阅读(139) 评论(0) 推荐(0)
POJ 2385 Apple Catching
摘要：Apple CatchingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6639Accepted: 3229DescriptionIt is a little known fact that cows love apples. F... 阅读全文
posted @ 2013-11-03 00:44 炒饭君 阅读(111) 评论(0) 推荐(0)
HDU 2524 矩形A + B
摘要：欢迎访问diao丝1号的博客!矩形A + BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3439Accepted Submission(s): ... 阅读全文
posted @ 2013-11-02 19:14 炒饭君 阅读(122) 评论(0) 推荐(0)
EBCDIC (多校联合赛第九场E题)
摘要：E. EBCDICTime Limit:2000msCase Time Limit:2000msMemory Limit:102400KB64-bit integer IO format:%I64d Java class name:MainSubmitStatusPID: 33810Font Siz... 阅读全文
posted @ 2013-11-02 18:18 炒饭君 阅读(176) 评论(0) 推荐(0)
ZOJ Flower (二分+网络流sap 算法)
摘要：ZOJ Problem Set - 3691FlowerTime Limit: 8 Seconds Memory Limit: 65536 KB Special JudgeGao and his girlfriend's relationship becomes better and bet... 阅读全文
posted @ 2013-11-01 20:53 炒饭君 阅读(166) 评论(0) 推荐(0)