lris0-0

摘要： 1051: [HAOI2006]受欢迎的牛Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 4091 Solved: 2194[Submit][Status][Discuss]Description 每一头牛的愿望就是... 阅读全文

posted @ 2016-06-18 10:23 lris0-0 阅读(81) 评论(0) 推荐(0)

摘要： Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15071 Accepted: 5992DescriptionA number of schools are con... 阅读全文

posted @ 2016-06-18 08:04 lris0-0 阅读(85) 评论(0) 推荐(0)

摘要： Tarjan算法整理（[转自：http://blog.sina.com.cn/s/blog_60707c0f0100xdh5.html][http://blog.sina.com.cn/s/blog_71aa4dbb01010qsc.html] [http://bl... 阅读全文

posted @ 2016-06-18 08:01 lris0-0 阅读(146) 评论(0) 推荐(0)

摘要： Gauss Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3144 Accepted... 阅读全文

posted @ 2016-06-01 17:44 lris0-0 阅读(102) 评论(0) 推荐(0)

摘要： FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12461 Accepted: 8855DescriptionIn the Fibonacci integer sequence, F... 阅读全文

posted @ 2016-05-23 07:16 lris0-0 阅读(97) 评论(0) 推荐(0)

摘要： Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4191 Accepted Submissio... 阅读全文

posted @ 2016-05-22 21:25 lris0-0 阅读(105) 评论(0) 推荐(0)

摘要： 1250 Fibonacci数列时间限制: 1 s 空间限制: 128000 KB 题目等级 : 钻石 Diamond 题目描述 Description 定义：f0=f1=1, fn=fn-1+fn-2(n>=2)。{fi}称为Fibonacci数列... 阅读全文

posted @ 2016-05-22 20:21 lris0-0 阅读(1119) 评论(0) 推荐(0)

摘要： Color Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9265 Accepted: 3010Description Beads of N colors are connected t... 阅读全文

posted @ 2016-05-22 19:21 lris0-0 阅读(78) 评论(0) 推荐(0)

摘要： Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5389 Accepted: 3603Description"Let it Bead" company is located up... 阅读全文

posted @ 2016-05-22 14:30 lris0-0 阅读(80) 评论(0) 推荐(0)

摘要： Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7588 Accepted: 3159DescriptionBeads of red, blue or green c... 阅读全文

posted @ 2016-05-22 11:44 lris0-0 阅读(105) 评论(0) 推荐(0)

既然无能更改、无法割舍，又何必枉自寻烦忧