I will Do iT @ hlyblog.net

题目描述：Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very surpr

两个操作 ,

题目就是问如何用最小的板覆盖所有的草地。可以横着放，也可以竖着放，允许一个草地放多个点。建图方法就是 每个横向的草地作为X，纵向连续的草地作为Y.     X连接Y的边表示，  这里有他们的公共点。。很显然，覆盖所有草地，就是覆盖所有的边//tpl//ipqhjjybj_tpl.h//header.h#include #include #include #inclu

最小路径覆盖 = n - 最大匹配

讲每个任务以及每个星期的每一天zuo

莫队算法。。不过 TLE

= =这题写搓了。。。d

最小树形图。就是从根节点出发，

详细解法请看这里:http://www.cnblogs.com/Missa/archive/2013/04/07/3005880.html

将house的右端点跟所有障碍物的左端点连接起来，之后延长交与property_line点x_left。将将house的左端点跟所有障碍物的右端点连接起来，之后延长交与bleacher点x_right。这样得到bleacher线上的left跟right点，从左到右扫描一次。 就可以算出答案了。

题目很简单的给定一个矩形，中间几条线段将它隔开， 给定玩具的坐标，最后统计各个区域内玩具的个数，输出有 k (k>0)个玩具的区域有多少个好久没写二分。写了好久。。#include #include #include #include #include using namespace std;#define ll __int64const int

题目：Click  here给出一个光源，给出一些圆，求投影区间。

题目描述:Up to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears an

题目描述:Bessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes her

最大流，X 集合为行， Y集合为列