
URAL
文章平均质量分 79
Joefery
生命不息,战斗不止。
展开
-
ural 1982. Electrification Plan 【最小生成树】
1982. Electrification PlanTime limit: 0.5 secondMemory limit: 64 MBSome country has n cities. The government has decided to electrify all these cities. At first, power stations in k diff原创 2016-09-07 20:17:54 · 634 阅读 · 0 评论 -
URAL 1297 Palindrome【后缀数组】求最长回文子串
DescriptionThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S. R原创 2016-10-11 03:22:27 · 893 阅读 · 0 评论 -
ural 1987. Nested Segments【离散化+贪心+线段树】
1987. Nested SegmentsTime limit: 1.0 secondMemory limit: 64 MBYou are given n segments on a straight line. For each pair of segments it is known that they either have no common points or原创 2016-09-07 21:28:15 · 560 阅读 · 0 评论 -
ural 1981. Parallel and Perpendicular 【规律】
1981. Parallel and PerpendicularTime limit: 0.5 secondMemory limit: 64 MBYou are given a regular n-gon. Your task is to calculate two values: the number of its diagonals that are paralle原创 2016-09-07 19:39:05 · 492 阅读 · 0 评论