大桃桃 - 博客园

HDU 6315 Naive Operations(线段树区间整除区间)

摘要： Problem DescriptionIn a galaxy far, far away, there are two integer sequence a and b of length n.b is a static permutation of 1 to n. Initially a is f 阅读全文

posted @ 2018-07-26 10:43 大桃桃阅读(983) 评论(0) 推荐(1)

TZOJ 1800 Martian Mining(二维dp)

摘要：描述 The NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the site of the ACM Finals this year). This is the place where the 阅读全文

posted @ 2018-07-19 11:35 大桃桃阅读(261) 评论(0) 推荐(0)

TZOJ 2415 Arctic Network(最小生成树第k小边)

摘要：描述 The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologie 阅读全文

posted @ 2018-07-19 10:56 大桃桃阅读(176) 评论(0) 推荐(0)

TZOJ 1937 Hie with the Pie(floyd+状压dp)

摘要：描述 The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hir 阅读全文

posted @ 2018-07-18 14:29 大桃桃阅读(143) 评论(0) 推荐(0)

TZOJ 4912 炮兵阵地(状压dp)

摘要：描述司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：阅读全文

posted @ 2018-07-17 12:09 大桃桃阅读(211) 评论(0) 推荐(0)

EOJ Monthly 2018.7 B.锐角三角形(数学几何+思维)

摘要：描述是否存在面积为S/2的整点锐角三角形？存在输出Yes并输出三个整点坐标，否则输出No。注意如果存在输出的坐标必须在long long范围内。 Input 第一行一个整数S(1<=S<=1018)，表示锐角三角形面积。 Output 第一行一个字符串。若存在接下去三行，每行两个整数X，Y，表阅读全文

posted @ 2018-07-16 10:43 大桃桃阅读(272) 评论(0) 推荐(0)

POJ 1684 Corn Fields(状压dp)

摘要：描述 Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy co 阅读全文

posted @ 2018-07-16 00:42 大桃桃阅读(256) 评论(0) 推荐(0)

POJ 1177 Picture(线段树周长并)

摘要：描述 A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. 阅读全文

posted @ 2018-07-10 23:26 大桃桃阅读(276) 评论(0) 推荐(0)

HDU 1255 覆盖的面积(线段树面积并)

摘要：描述给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input 输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代表平面上的一个矩形的左上角坐阅读全文

posted @ 2018-07-10 22:53 大桃桃阅读(186) 评论(0) 推荐(0)

HDU 1542 Atlantis(线段树面积并)

摘要：描述 There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of th 阅读全文

posted @ 2018-07-10 21:36 大桃桃阅读(151) 评论(0) 推荐(0)

HDU 4614 Vases and Flowers(二分+线段树区间查询修改)

摘要：描述Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try 阅读全文

posted @ 2018-07-10 21:12 大桃桃阅读(191) 评论(0) 推荐(0)

HDU 3974 Assign the task(DFS序+线段树单点查询，区间修改)

摘要：描述There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole com 阅读全文

posted @ 2018-07-09 23:32 大桃桃阅读(534) 评论(0) 推荐(0)

HDU 4027 Can you answer these queries? (线段树区间修改查询)

摘要：描述A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. 阅读全文

posted @ 2018-07-08 23:46 大桃桃阅读(175) 评论(0) 推荐(0)

ZOJ 1610 Count the Color(线段树区间更新)

摘要：描述Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segm 阅读全文

posted @ 2018-07-08 23:22 大桃桃阅读(150) 评论(0) 推荐(0)

HDU 1698 Just a Hook(线段树区间更新查询)

摘要：描述 In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metal 阅读全文

posted @ 2018-07-08 00:18 大桃桃阅读(235) 评论(0) 推荐(0)