摘要: StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1136 Accepted Submission(s): 792 Problem De... 阅读全文
posted @ 2015-10-10 23:28 柳下_MBX 阅读(154) 评论(0) 推荐(0) 编辑
摘要: 参考链接: http://blog.csdn.net/acm_cxlove/article/details/8565309 http://www.cnblogs.com/Rlemon/archive/2013/05/24/3096264.html http://seter.is-programmer 阅读全文
posted @ 2015-10-10 19:07 柳下_MBX 阅读(118) 评论(0) 推荐(0) 编辑
摘要: The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文
posted @ 2015-10-10 19:03 柳下_MBX 阅读(358) 评论(0) 推荐(0) 编辑
摘要: SPOJ 10628. Count on a tree (树上第k大,LCA+主席树) 10628. Count on a tree Problem code: COT You are given a tree with N nodes.The tree nodes are numbered fro 阅读全文
posted @ 2015-10-10 18:44 柳下_MBX 阅读(378) 评论(0) 推荐(0) 编辑
摘要: 现在给出N个字母,(前N个大写字母),然后给出M个关系,每个关系只有大于和小于两种。 最后判断那些是可以确定他应有的大小位置的。 (没有给出的关系,均属于不可确定) 本题要求输出可以确定的人的排名2,首先需要建两个图,正向建一个反向建一个。 由于是有向图,对两个图中的每一个点进行bfs,记录以他为起 阅读全文
posted @ 2015-10-10 17:04 柳下_MBX 阅读(355) 评论(0) 推荐(0) 编辑
摘要: D-query Time Limit: 227MS Memory Limit: 1572864KB 64bit IO Format: %lld & %llu Submit Status Description English Vietnamese Given a sequence of n numb 阅读全文
posted @ 2015-10-10 12:40 柳下_MBX 阅读(224) 评论(0) 推荐(0) 编辑
摘要: K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 43315 Accepted: 14296 Case Time Limit: 2000MS Description You are working for 阅读全文
posted @ 2015-10-10 12:23 柳下_MBX 阅读(155) 评论(0) 推荐(0) 编辑
摘要: Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3625 Accepted Submission(s): 1660 Pro 阅读全文
posted @ 2015-10-10 11:24 柳下_MBX 阅读(211) 评论(0) 推荐(0) 编辑