11 2014 档案

Codeforces Round #176 (Div. 1) B. Shifting
摘要：B. Shiftingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJohn Doe has found the beautiful perm... 阅读全文

posted @ 2014-11-29 22:31 _log__ 阅读(234) 评论(0) 推荐(1) 编辑

hdu magic balls
摘要：magic ballsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 74Accepted Submission(s): 10Problem Des... 阅读全文

posted @ 2014-11-29 22:06 _log__ 阅读(189) 评论(0) 推荐(0) 编辑

soj 12647. Sightseeing
摘要：12647. SightseeingConstraintsTime Limit: 20 secs, Memory Limit: 256 MBDescriptionA travel agent wants to organize a sightseeing trip in a city for tou... 阅读全文

posted @ 2014-11-29 13:11 _log__ 阅读(208) 评论(0) 推荐(0) 编辑

soj 12646. ORCHARD
摘要：12646. ORCHARDConstraintsTime Limit: 3 secs, Memory Limit: 256 MBDescriptionAlex and Bert are brothers who had been working for many years in a big or... 阅读全文

posted @ 2014-11-29 13:00 _log__ 阅读(201) 评论(0) 推荐(0) 编辑

Codeforces Round #174 (Div. 1) B. Cow Program
摘要：B. Cow Programtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFarmer John has just given the cow... 阅读全文

posted @ 2014-11-27 21:54 _log__ 阅读(309) 评论(0) 推荐(0) 编辑

Codeforces Round #278 (Div. 1) B. Strip
摘要：B. Striptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlexandra has a paper strip withnnumbers ... 阅读全文

posted @ 2014-11-22 22:48 _log__ 阅读(328) 评论(0) 推荐(1) 编辑

北京赛区总结
摘要：在西安赛区之前，我觉得我们队出去打区域赛最差也就是拿个铜，可是在西安赛区，我们有两只队伍在那里打铁了，所以去北京赛区，我总会想我们队万一打铁了怎么办。。瞬间感觉压力好大 。我们是13号的火车，14号到了北京。13号在广州上车的时候，行李箱里面的东西都要翻出来看看，安检的女的翻到我的湿纸巾，就问，怎么... 阅读全文

posted @ 2014-11-19 16:53 _log__ 阅读(129) 评论(0) 推荐(0) 编辑

hdu 5102 The K-th Distance
摘要：The K-th DistanceTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 27Accepted Submission(s): 5Proble... 阅读全文

posted @ 2014-11-08 22:32 _log__ 阅读(155) 评论(0) 推荐(0) 编辑

hdu 5101
摘要：SelectTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 68Accepted Submission(s): 18Problem Descript... 阅读全文

posted @ 2014-11-08 22:19 _log__ 阅读(152) 评论(0) 推荐(0) 编辑

Codeforces Round #104 (Div. 1) E. Lucky Queries
摘要：E. Lucky Queriestime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves lucky numbers very m... 阅读全文

posted @ 2014-11-05 20:57 _log__ 阅读(203) 评论(0) 推荐(0) 编辑

Codeforces Round #104 (Div. 1) C. Lucky Subsequence
摘要：C. Lucky Subsequencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves lucky numbers ve... 阅读全文

posted @ 2014-11-05 20:52 _log__ 阅读(388) 评论(0) 推荐(0) 编辑

UVALive 4848 Tour Belt
摘要：F -Tour BeltTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 4848DescriptionKorea has many tourist attractions.... 阅读全文

posted @ 2014-11-04 22:56 _log__ 阅读(275) 评论(0) 推荐(0) 编辑

fzoj 2116 买糖果
摘要：Problem 2116 买糖果Accept: 76Submit: 294Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description清明君、五一君和六一君三个人是好朋友。他们很喜欢去一家糖果店买糖果，糖果店有巧克力和草莓两种口味的糖... 阅读全文

posted @ 2014-11-04 22:47 _log__ 阅读(177) 评论(0) 推荐(0) 编辑

fzoj 2119 祖先问题
摘要：Problem 2119 祖先问题Accept: 18Submit: 82Time Limit: 3000 mSecMemory Limit : 32768 KBProblem Description有n个结点构成了多棵树，给出每个结点的父节点，若为-1则表示该结点无父节点。每个结点的父节点编号必须... 阅读全文

posted @ 2014-11-04 22:41 _log__ 阅读(211) 评论(0) 推荐(0) 编辑

hdu 4718 The LCIS on the Tree
摘要：The LCIS on the TreeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 528Accepted Submission(s): 165... 阅读全文

posted @ 2014-11-03 16:25 _log__ 阅读(210) 评论(0) 推荐(0) 编辑

hihoCoder挑战赛4 光棍节
摘要：题目3 : 光棍节时间限制:30000ms单点时限:1000ms内存限制:256MB描述尽管付出了种种努力，jzp还是得过光棍节。jzp非常不爽，但也无能为力，只能够哀叹起来他的命运。他想到了一位长者的人生经验：“人的一生，不光要靠自我奋斗，也要考虑历史的进程”。他终于明白自己只是时运不济，所以又继... 阅读全文

posted @ 2014-11-02 23:09 _log__ 阅读(235) 评论(0) 推荐(0) 编辑

hdu 3717 Rescue
摘要：RescueTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 708Accepted Submission(s): 167Problem Descri... 阅读全文

posted @ 2014-11-01 00:41 _log__ 阅读(320) 评论(0) 推荐(0) 编辑

数位DP小小结
摘要：FZOJProblem 2113 Jason的特殊爱好题意：x~y数字里面有多少个 1思路:我们算法课实验题的简化版，当时我用了很麻烦的一个DP=_=刚刚学到了很棒的姿势，记忆化DP！！dfs(int pos ,bool end1) ;end1==false 返回pos位后面（包含pos）任意组合有... 阅读全文

posted @ 2014-11-01 00:18 _log__ 阅读(200) 评论(0) 推荐(0) 编辑