07 2016 档案

暑假训练round 3 题解
摘要：今天做题运气出奇的好，除了几处小错误调试之后忘记改掉了……最后还AK了……虽然题目不难，学长也说是福利局，但是对个人的鼓励作用还是挺大的……至此暑假训练就结束了，也算没有遗憾……。 题解如下： Problem A: 苦逼的MCA Problem A: 苦逼的MCA Time Limits: 1000 阅读全文
posted @ 2016-07-31 21:41 Blackops 阅读(331) 评论(0) 推荐(0)
Educational Codeforces Round 15 C. Cellular Network（二分）
摘要：C. Cellular Network time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given n poin 阅读全文
posted @ 2016-07-31 11:36 Blackops 阅读(156) 评论(0) 推荐(0)
HDU 1044 Collect More Jewels（BFS+DFS）
摘要：Collect More Jewels Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6713 Accepted Submission(s): 阅读全文
posted @ 2016-07-29 18:00 Blackops 阅读(345) 评论(0) 推荐(0)
NBOJv2 Problem 1009 蛤玮的魔法（二分）
摘要：Problem 1009: 蛤玮的魔法 Problem 1009: 蛤玮的魔法 Time Limits: 1000 MS Memory Limits: 65536 KB 64-bit interger IO format: %lld Java class name: Main Time Limits 阅读全文
posted @ 2016-07-28 23:02 Blackops 阅读(300) 评论(0) 推荐(0)
HDU 1016 Prime Ring Problem（经典DFS+回溯）
摘要：Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 42600 Accepted Submission(s): 阅读全文
posted @ 2016-07-27 17:57 Blackops 阅读(179) 评论(0) 推荐(0)
HDU 2181 哈密顿绕行世界问题（经典DFS+回溯）
摘要：哈密顿绕行世界问题 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3105 Accepted Submission(s): 1918 Prob 阅读全文
posted @ 2016-07-27 16:22 Blackops 阅读(195) 评论(0) 推荐(0)
OpenCV学习笔记——滑动条开关
摘要：由于opencv库中并没有专门为开关而设的函数，可以用滑动条做开关 代码： 阅读全文
posted @ 2016-07-27 14:46 Blackops 阅读(366) 评论(0) 推荐(0)
POJ 3321 Apple Tree（DFS序+线段树单点修改区间查询）
摘要：Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25904 Accepted: 7682 Description There is an apple tree outside of kaka's house. 阅读全文
posted @ 2016-07-26 14:04 Blackops 阅读(315) 评论(0) 推荐(0)
暑假训练round2 D: 好序列（Manacher）
摘要：Problem 1061: 好序列 Problem 1061: 好序列 Time Limits: 1000 MS Memory Limits: 65536 KB 64-bit interger IO format: %lld Java class name: Main Time Limits: 10 阅读全文
posted @ 2016-07-25 15:24 Blackops 阅读(421) 评论(0) 推荐(0)
HDU 1698 Just a Hook（线段树区间替换）
摘要：Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27359 Accepted Submission(s): 13593 阅读全文
posted @ 2016-07-25 14:22 Blackops 阅读(242) 评论(0) 推荐(0)
NBOJv2 1034 Salary Inequity（DFS序+线段树区间更新区间（最值）查询）
摘要：Problem 1034: Salary Inequity Problem 1034: Salary Inequity Time Limits: 10000 MS Memory Limits: 200000 KB 64-bit interger IO format: %lld Java class 阅读全文
posted @ 2016-07-22 17:46 Blackops 阅读(314) 评论(0) 推荐(0)
NBOJv2 1004 蛤玮打扫教室（线段树区间更新区间最值查询）
摘要：Problem 1004: 蛤玮打扫教室 Problem 1004: 蛤玮打扫教室 Time Limits: 1000 MS Memory Limits: 65536 KB 64-bit interger IO format: %lld Java class name: Main Time Limi 阅读全文
posted @ 2016-07-21 16:26 Blackops 阅读(267) 评论(0) 推荐(0)
NBOJv2 1050 Just Go（线段树/树状数组区间更新单点查询）
摘要：Problem 1050: Just Go Problem 1050: Just Go Time Limits: 3000 MS Memory Limits: 65536 KB 64-bit interger IO format: %lld Java class name: Main Time Li 阅读全文
posted @ 2016-07-19 12:35 Blackops 阅读(314) 评论(0) 推荐(0)
POJ 3468 A Simple Problem with Integers（线段树区间更新区间查询）
摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 92632 Accepted: 28818 Case Time Limit: 2000MS Description Y 阅读全文
posted @ 2016-07-18 15:27 Blackops 阅读(218) 评论(0) 推荐(0)
HDU 1754 I Hate It（线段树单点更新区间最值查询）
摘要：I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 62944 Accepted Submission(s): 24440 Pr 阅读全文
posted @ 2016-07-17 23:35 Blackops 阅读(187) 评论(0) 推荐(0)
HDU 1166敌兵布阵+NOJv2 1025: Hkhv love spent money（线段树单点更新区间查询）
摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 73866 Accepted Submission(s): 30997 Problem 阅读全文
posted @ 2016-07-17 15:04 Blackops 阅读(233) 评论(0) 推荐(0)
GDUT——1169: Krito的讨伐（优先队列BFS）
摘要：1169: Krito的讨伐 Description Krito终于干掉了99层的boss，来到了第100层。第100层可以表示成一颗树，这棵树有n个节点（编号从0到n-1），树上每一个节点可能有很多只怪物。 Krito现在在0号节点，现在它想要区清除这一层所有的怪物。他现在有atk大小的攻击力。只 阅读全文
posted @ 2016-07-16 15:22 Blackops 阅读(190) 评论(0) 推荐(0)
HDU——2444The Accomodation of Students（BFS判二分图+最大匹配裸题）
摘要：The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4915 Accepted Submi 阅读全文
posted @ 2016-07-16 11:19 Blackops 阅读(340) 评论(0) 推荐(0)
HDU——1045Fire Net（最大匹配）
摘要：Fire Net Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9897 Accepted Submission(s): 5750 Probl 阅读全文
posted @ 2016-07-15 23:32 Blackops 阅读(350) 评论(0) 推荐(0)
OpenJ_Bailian——4115鸣人和佐助（带状态的A*）
摘要：鸣人和佐助 Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u Submit Status Description 佐助被大蛇丸诱骗走了，鸣人在多少时间内能追上他呢？ 已知一张地图（以二维矩阵的形式表示）以及 阅读全文
posted @ 2016-07-13 11:52 Blackops 阅读(542) 评论(0) 推荐(0)
UVa——1600Patrol Robot（A*或普通BFS）
摘要：Patrol Robot Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Description A robot has to patrol around a rectangular area which i 阅读全文
posted @ 2016-07-12 12:28 Blackops 阅读(250) 评论(0) 推荐(0)
POJ——2449Remmarguts' Date（A*+SPFA）
摘要：Remmarguts' Date Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 26504 Accepted: 7203 Description "Good man never makes girls wait or break 阅读全文
posted @ 2016-07-11 11:12 Blackops 阅读(322) 评论(0) 推荐(0)
暑假训练Round1——G: Hkhv的水题之二（字符串的最小表示）
摘要：Problem 1057: Hkhv的水题之二 Problem 1057: Hkhv的水题之二 Time Limits: 1000 MS Memory Limits: 65536 KB 64-bit interger IO format: %lld Java class name: Main Tim 阅读全文
posted @ 2016-07-10 23:14 Blackops 阅读(229) 评论(0) 推荐(0)
Codeforces Round #354 (Div. 2)——C. Vasya and String（尺取）
摘要：C. Vasya and String time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Vasya and String t 阅读全文
posted @ 2016-07-10 10:38 Blackops 阅读(211) 评论(0) 推荐(0)
NOJ——1628Alex’s Game(III)（DFS+回溯）
摘要：[1628] Alex’s Game(III) 时间限制: 1000 ms　内存限制: 65535 K 问题描述 Alex likes to play with one and zero as you know . But Alex does’t have a girlfriend now beca 阅读全文
posted @ 2016-07-08 23:44 Blackops 阅读(186) 评论(0) 推荐(0)
Codeforces Round #361 (Div. 2)——B. Mike and Shortcuts（BFS+小坑）
摘要：B. Mike and Shortcuts time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output B. Mike and Shortc 阅读全文
posted @ 2016-07-08 09:44 Blackops 阅读(205) 评论(0) 推荐(0)
Codeforces Round #360 (Div. 2)——C. NP-Hard Problem（BFS染色判二分图）
摘要：C. NP-Hard Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. NP-Hard Problem ti 阅读全文
posted @ 2016-07-07 20:15 Blackops 阅读(245) 评论(0) 推荐(0)
HDU——2955Robberies（小数背包）
摘要：Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19862 Accepted Submission(s): 7344 Pro 阅读全文
posted @ 2016-07-07 13:11 Blackops 阅读(334) 评论(0) 推荐(0)
HDU——1059Dividing（母函数或多重背包）
摘要：Dividing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23277 Accepted Submission(s): 6616 Prob 阅读全文
posted @ 2016-07-06 22:01 Blackops 阅读(386) 评论(0) 推荐(0)
HDU——2083找单词（母函数）
摘要：找单词 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5957 Accepted Submission(s): 4185 Problem De 阅读全文
posted @ 2016-07-03 22:44 Blackops 阅读(436) 评论(0) 推荐(0)
HDU——3786找出直系亲属（DFS+回溯）
摘要：找出直系亲属 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1541 Accepted Submission(s): 621 Problem 阅读全文
posted @ 2016-07-01 19:22 Blackops 阅读(254) 评论(0) 推荐(0)
HDU——2612Find a way（多起点多终点BFS）
摘要：Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9698 Accepted Submission(s): 3165 Pro 阅读全文
posted @ 2016-07-01 16:28 Blackops 阅读(265) 评论(0) 推荐(0)
HDU——1242Rescue（BFS+优先队列求点图最短路）
摘要：Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25203 Accepted Submission(s): 8936 Proble 阅读全文
posted @ 2016-07-01 11:26 Blackops 阅读(253) 评论(0) 推荐(0)
NOJ——1642简单的图论问题?（BFS+优先队列）
摘要：[1642] 简单的图论问题? 时间限制: 5000 ms　内存限制: 65535 K 问题描述 给一个 n 行 m 列的迷宫,每个格子要么是障碍物要么是空地。每个空地里都有一个权值。你的 任务是从找一条(r1,c1)到(r2,c2)的路径,使得经过的空地的权值之和最小。每一步可以往上下 左右四个方 阅读全文
posted @ 2016-07-01 00:52 Blackops 阅读(344) 评论(0) 推荐(0)