04 2018 档案

dfs序 二进制优化 Codeforces Round #316 (Div. 2)D. Tree Requests
摘要：D. Tree Requests time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Roman plant... 阅读全文
posted @ 2018-04-16 21:01 ACagain 阅读(106) 评论(0) 推荐(0) 编辑
Codeforces Round #318 D. Bear and Blocks
摘要：D. Bear and Blocks time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Limak is a... 阅读全文
posted @ 2018-04-16 20:38 ACagain 阅读(104) 评论(0) 推荐(0) 编辑
Codeforces Round #320 (Div. 2)C. A Problem about Polyline
摘要：题目： There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – … - (2kx, 0) – (2kx + x, x) – ….We know t... 阅读全文
posted @ 2018-04-16 20:32 ACagain 阅读(113) 评论(0) 推荐(0) 编辑