上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 86 下一页
摘要: TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16851 Accepted: 8069 Description Calculate the number of toys that land in each bin of 阅读全文
posted @ 2017-12-24 12:44 zbtrs 阅读(158) 评论(0) 推荐(0) 编辑
摘要: Build Your Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1121 Accepted: 621 Description Mr. Tenant is going to buy a new house. In f 阅读全文
posted @ 2017-12-24 11:58 zbtrs 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17149 Accepted: 7373 Description We all know that a pair of distinct poi 阅读全文
posted @ 2017-12-24 11:38 zbtrs 阅读(220) 评论(0) 推荐(0) 编辑
摘要: Statement of the Problem Several drawing applications allow us to draw polygons and almost all of them allow us to fill them with some color. The task 阅读全文
posted @ 2017-12-24 10:21 zbtrs 阅读(202) 评论(0) 推荐(0) 编辑
摘要: You're given a tree on N vertices. Each vertex has a positive integer written on it, number on the ith vertex being vi. Your program must process two 阅读全文
posted @ 2017-12-23 23:50 zbtrs 阅读(332) 评论(0) 推荐(0) 编辑
摘要: F. Heroes of Making Magic III time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output F. Heroes 阅读全文
posted @ 2017-12-23 09:38 zbtrs 阅读(318) 评论(0) 推荐(0) 编辑
摘要: 2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作,操作有2类: 1、将节点a到节点b路径上所有点都染成颜色c; 2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段), 如“112221”由3段组成:“11”、“222”和“1”。 请 阅读全文
posted @ 2017-12-23 00:01 zbtrs 阅读(230) 评论(0) 推荐(0) 编辑
摘要: Decrypt Messages Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 657 Accepted Submission(s): 158 阅读全文
posted @ 2017-12-22 23:56 zbtrs 阅读(274) 评论(0) 推荐(0) 编辑
摘要: 1036: [ZJOI2008]树的统计Count Description 一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节 阅读全文
posted @ 2017-12-22 19:01 zbtrs 阅读(211) 评论(0) 推荐(0) 编辑
摘要: 1367: [Baltic2004]sequence Description Input Output 一个整数R Sample Input 7 9 4 8 20 14 15 18 Sample Output 13 HINT 所求的Z序列为6,7,8,13,14,15,18. R=13 分析:左偏树 阅读全文
posted @ 2017-12-22 16:15 zbtrs 阅读(243) 评论(0) 推荐(0) 编辑
上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 86 下一页