
POJ
JokerPoker
已经失去安安静静专注下来做好一件事情的能力了。
展开
-
poj 1279 Art Gallery
DescriptionThe art galleries ofthe new and very futuristic building of the Center for BalkanCooperation have the form of polygons (not necessarily convex).When a big exhibition is organized, watch原创 2014-12-29 08:40:37 · 431 阅读 · 0 评论 -
poj 1634 Prison rearrangement
DescriptionIn order to lower the risk of riots and escapeattempts, the boards of two nearby prisons of equal prisonercapacity, have decided to rearrange their prisoners amongthemselves. They want原创 2014-12-29 08:39:51 · 377 阅读 · 0 评论 -
poj 1741 Tree
DescriptionGive a tree with nvertices,each edge has a length(positive integer less than1001).Define dist(u,v)=The min distance between node u and v.Give an integer k,for every pair (u,v) of verti原创 2014-12-29 08:40:32 · 378 阅读 · 0 评论 -
poj 2131 Key Insertion
DescriptionAs an employee of the Macrohard Company, you havebeen asked to implement the new data structure that would be usedto store some integer keys. The keys must be stored in a special ordere原创 2014-12-29 08:40:04 · 416 阅读 · 0 评论 -
poj 2001 Shortest Prefixes
DescriptionA prefix of a string is asubstring starting at the beginning of the given string. Theprefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and"carbon". Note that the empty string原创 2014-12-29 08:40:01 · 313 阅读 · 0 评论 -
poj 1442 Black Box
http://poj.org/problem?id=1442题目又臭又长就不贴了,给两串数a[i],u[i]长度分别为M,N(我读入的时候是N,M。习惯了。。。)。对于每个u[i],输出a数组前u[i]个中从小到大的第i个数。//=================================================================================原创 2014-12-29 08:39:59 · 269 阅读 · 0 评论 -
poj 1848 Tree
DescriptionConsider a tree withN vertices, numbered from 1 to N. Add, if it is possible, a minimumnumber of edges thus every vertex belongs to exactly onecycle.InputThe input has thefollowing s原创 2014-12-29 08:39:56 · 340 阅读 · 0 评论 -
poj 3667 Hotel
http://poj.org/problem?id=3667题目大意:给定长度n的空序列和m个操作。操作分两种:1 x:询问长度为x的最左端的空子序列,输出子序列左端点。2 x l:清空从x开始长度为l的序列(不一定l长度里面都是非空的)。 比较基础的线段树实现的段修改。线段树上每个单元记录当前段中最长的空段max,左端开始最长的空段lmax,右端开始最长的空段rmax。 ACC原创 2014-12-29 08:34:30 · 271 阅读 · 0 评论 -
poj 2528 Mayor's posters
http://poj.org/problem?id=2528题目大意:有一面被划分成n格的墙,依次停入m两车,每辆车占据第l[i]~r[i]格的墙。问最后能看到几辆车。有多组数据。 线段树+离散。每次停车用不同的值覆盖一段给定区间,最后统计整段上不同的值有多少即为所求。 一开始抱着侥幸心理直接上线段树,结果MLE。。。接下来又WA了两次。第一次是没考虑下面这种情况:131 10原创 2014-12-29 08:34:27 · 428 阅读 · 0 评论 -
poj 1474 Video Surveillance
DescriptionA friend of yours has taken thejob of security officer at the Star-Buy Company, a famous depart-ment store. One of his tasks is to install a video surveillancesystem to guarantee the se原创 2014-12-29 08:40:42 · 520 阅读 · 0 评论 -
poj 2778 DNA Sequence
DescriptionIt's well known that DNA Sequence is a sequenceonly contains A, C, T and G, and it's very useful to analyze asegment of DNA Sequence,For example, if a animal's DNAsequence contains se原创 2014-12-29 08:39:48 · 383 阅读 · 0 评论 -
poj 2828 Buy Tickets
DescriptionRailway tickets were difficult to buy around the Lunar NewYear in China, so we must get up early and join a longqueue…The Lunar New Year was approaching, but unluckily the Little Cats原创 2014-12-29 08:34:13 · 464 阅读 · 0 评论 -
poj 3335 Rotating Scoreboard
DescriptionThis year, ACM/ICPC World finals will be held in a hall in formof a simple polygon. The coaches and spectators are seated alongthe edges of the polygon. We want to place a rotating scor原创 2014-12-29 08:40:40 · 434 阅读 · 0 评论