2016年12月8日
hdu 4358 Boring counting dfs序+莫队+离散化
摘要： Boring counting Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 98304/98304 K (Java/Others) Problem Description In this problem we consider a roo 阅读全文
posted @ 2016-12-08 15:56 jhz033 阅读(219) 评论(0) 推荐(0)
Codeforces Round #316 (Div. 2) D. Tree Requests dfs序
摘要： D. Tree Requests time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Roman planted a tree co 阅读全文
posted @ 2016-12-08 10:59 jhz033 阅读(250) 评论(0) 推荐(0)