2015年11月25日
Codeforces Round #333 (Div. 1) C. Kleofáš and the n-thlon 树状数组优化dp
摘要： C. Kleofáš and the n-thlonTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/601/problem/CDescriptionKleofáš is participating in ... 阅读全文
posted @ 2015-11-25 13:29 qscqesze 阅读(479) 评论(0) 推荐(1) 编辑
Codeforces Round #333 (Div. 1) B. Lipshitz Sequence 倍增 二分
摘要： B. Lipshitz SequenceTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/601/problem/BDescriptionA functionis called Lipschitz cont... 阅读全文
posted @ 2015-11-25 12:05 qscqesze 阅读(485) 评论(9) 推荐(0) 编辑
Codeforces Round #333 (Div. 2) C. The Two Routes flyod
摘要： C. The Two RoutesTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/602/problem/CDescriptionIn Absurdistan, there arentowns (numb... 阅读全文
posted @ 2015-11-25 11:32 qscqesze 阅读(464) 评论(0) 推荐(0) 编辑
Codeforces Round #333 (Div. 2) B. Approximating a Constant Range st 二分
摘要： B. Approximating a Constant RangeTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/602/problem/BDescriptionWhen Xellos was doing... 阅读全文
posted @ 2015-11-25 11:12 qscqesze 阅读(548) 评论(0) 推荐(0) 编辑
Codeforces Round #333 (Div. 2) A. Two Bases 水题
摘要： A. Two BasesTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/602/problem/ADescriptionAfter seeing the "ALL YOUR BASE ARE BELONG... 阅读全文
posted @ 2015-11-25 10:49 qscqesze 阅读(375) 评论(0) 推荐(0) 编辑
SPOJ 1557. Can you answer these queries II 线段树
摘要： Can you answer these queries IITime Limit: 20 SecMemory Limit: 256 MB题目连接https://www.spoj.com/problems/GSS2/DescriptionBeing a completist and a simpli... 阅读全文
posted @ 2015-11-25 00:28 qscqesze 阅读(600) 评论(0) 推荐(0) 编辑