随笔分类 -  乱搞-构造题

摘要:地址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3965 题目: iven two depth-first-search (DFS) sequences of a binary tree, can you find a 阅读全文
posted @ 2017-04-27 22:07 weeping 阅读(761) 评论(0) 推荐(0) 编辑
摘要:地址:http://codeforces.com/contest/782/problem/E 题目: E. Underground Lab time limit per test 1 second memory limit per test 256 megabytes input standard 阅读全文
posted @ 2017-03-07 20:09 weeping 阅读(186) 评论(0) 推荐(0) 编辑
摘要:地址:http://codeforces.com/contest/765/problem/D 题目: D. Artsem and Saunders time limit per test 2 seconds memory limit per test 512 megabytes input stan 阅读全文
posted @ 2017-02-20 19:16 weeping 阅读(213) 评论(0) 推荐(0) 编辑
该文被密码保护。
posted @ 2016-10-11 18:43 weeping 阅读(15) 评论(0) 推荐(0) 编辑
该文被密码保护。
posted @ 2016-09-22 19:33 weeping 阅读(52) 评论(0) 推荐(0) 编辑