h_z_cong - 博客园

HDU1255 覆盖的面积 —— 求矩形交面积线段树 + 扫描线 + 离散化

摘要：题目链接：https://vjudge.net/problem/HDU-1255 给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的阅读全文

posted @ 2017-10-28 11:08 h_z_cong 阅读(310) 评论(0) 推荐(0) 编辑

HDU1542 Atlantis —— 求矩形面积并线段树 + 扫描线 + 离散化

摘要：题目链接：https://vjudge.net/problem/HDU-1542 There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these 阅读全文

posted @ 2017-10-28 11:05 h_z_cong 阅读(201) 评论(0) 推荐(0) 编辑

HDU1540 Tunnel Warfare —— 线段树区间合并

摘要：题目链接：https://vjudge.net/problem/HDU-1540 uring the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of no 阅读全文

posted @ 2017-10-28 10:52 h_z_cong 阅读(268) 评论(0) 推荐(0) 编辑

HDU3974 Assign the task —— dfs时间戳 + 线段树

摘要：题目链接：https://vjudge.net/problem/HDU-3974 There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate b 阅读全文

posted @ 2017-10-24 21:55 h_z_cong 阅读(272) 评论(0) 推荐(0) 编辑

HDU4027 Can you answer these queries? —— 线段树区间修改

摘要：题目链接：https://vjudge.net/problem/HDU-4027 A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secre 阅读全文

posted @ 2017-10-24 21:45 h_z_cong 阅读(252) 评论(0) 推荐(0) 编辑

POJ3264 Balanced Lineup —— 线段树单点更新区间最大最小值

摘要：题目链接：https://vjudge.net/problem/POJ-3264 For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer 阅读全文

posted @ 2017-10-24 21:38 h_z_cong 阅读(186) 评论(0) 推荐(0) 编辑

ZOJ1610 Count the Colors —— 线段树区间染色

摘要：题目链接：https://vjudge.net/problem/ZOJ-1610 Painting some colored segments on a line, some previously painted segments may be covered by some the subsequ 阅读全文

posted @ 2017-10-24 21:34 h_z_cong 阅读(429) 评论(0) 推荐(0) 编辑

HDU1698 Just a Hook —— 线段树区间染色

摘要：题目链接：https://vjudge.net/problem/HDU-1698 In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook i 阅读全文

posted @ 2017-10-24 21:27 h_z_cong 阅读(197) 评论(0) 推荐(0) 编辑

POJ2528 Mayor's posters —— 线段树染色 + 离散化

摘要：题目链接：https://vjudge.net/problem/POJ-2528 The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been 阅读全文

posted @ 2017-10-24 21:24 h_z_cong 阅读(289) 评论(0) 推荐(0) 编辑

POJ3468 A Simple Problem with Integers —— 线段树区间修改

摘要：题目链接：https://vjudge.net/problem/POJ-3468 You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation i 阅读全文

posted @ 2017-10-24 21:11 h_z_cong 阅读(199) 评论(0) 推荐(0) 编辑

HDU1754 —— I Hate It 线段树单点修改及区间最大值

摘要：题目链接：https://vjudge.net/problem/HDU-1754 很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同阅读全文

posted @ 2017-10-24 21:05 h_z_cong 阅读(253) 评论(0) 推荐(0) 编辑

HDU1166 敌兵布阵 —— 线段树单点修改

摘要：题目链接：https://vjudge.net/problem/HDU-1166 C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监阅读全文

posted @ 2017-10-24 20:56 h_z_cong 阅读(242) 评论(0) 推荐(0) 编辑

POJ3694 Network —— 边双联通分量 + 缩点 + LCA + 并查集

摘要：题目链接：https://vjudge.net/problem/POJ-3694 A network administrator manages a large network. The network consists of N computers and M links between pair 阅读全文

posted @ 2017-10-20 21:11 h_z_cong 阅读(525) 评论(0) 推荐(0) 编辑

HDU4738 Caocao's Bridges —— 边双联通分量 + 重边

摘要：题目链接：https://vjudge.net/problem/HDU-4738 A network administrator manages a large network. The network consists of N computers and M links between pair 阅读全文

posted @ 2017-10-20 21:07 h_z_cong 阅读(333) 评论(0) 推荐(0) 编辑

HDU4612 Warm up —— 边双联通分量 + 重边 + 缩点 + 树上最长路

摘要：题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=4612 Warm up Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Tot 阅读全文

posted @ 2017-10-18 21:38 h_z_cong 阅读(296) 评论(0) 推荐(0) 编辑