见字如面

摘要： skiing 时间限制：3000 ms | 内存限制：65535 KB 阅读全文

posted @ 2017-04-05 00:30 见字如面阅读(188) 评论(0) 推荐(0) 编辑

摘要： How far away ？ Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14809 Accepted Submission(s): 562 阅读全文

posted @ 2017-04-01 23:33 见字如面阅读(540) 评论(0) 推荐(0) 编辑

CodeForces - 789D Weird journey

摘要： D. Weird journey time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little boy Igor wants t 阅读全文

posted @ 2017-04-01 21:41 见字如面阅读(438) 评论(0) 推荐(0) 编辑

hdu 4704(费马小定理+快速幂取模）

摘要： Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2633 Accepted Submission(s): 1104 Problem 阅读全文

posted @ 2017-03-27 20:55 见字如面阅读(528) 评论(0) 推荐(0) 编辑

poj 1741（树的点分治）

摘要： Tree Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give 阅读全文

posted @ 2017-03-27 19:11 见字如面阅读(150) 评论(0) 推荐(0) 编辑

POJ - 3107 Godfather（树的重心）

摘要： Godfather Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decide 阅读全文

posted @ 2017-03-26 22:37 见字如面阅读(289) 评论(0) 推荐(0) 编辑

hdu 1429（BFS+状态压缩）

摘要：胜利大逃亡(续) Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8379 Accepted Submission(s): 3008 Proble 阅读全文

posted @ 2017-03-23 00:00 见字如面阅读(118) 评论(0) 推荐(0) 编辑

hdu 1242(BFS+优先队列）

摘要： Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29263 Accepted Submission(s): 10342 Proble 阅读全文

posted @ 2017-03-20 22:33 见字如面阅读(293) 评论(0) 推荐(0) 编辑

hdu 2205（容斥原理）

摘要： Eddy's爱好 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2470 Accepted Submission(s): 1135 Proble 阅读全文

posted @ 2017-03-19 23:13 见字如面阅读(314) 评论(0) 推荐(0) 编辑

动态规划多种题型

摘要：数字三角形数塔 Problem Description 在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗? Input 输入数据首先包括一阅读全文

posted @ 2017-03-17 17:15 见字如面阅读(373) 评论(0) 推荐(0) 编辑

公告

导航