![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
yasolx
ACMer
展开
-
HDU 2333 && POJ 3497 && UVA 12124 Assemble(二分最大化最小值)
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3462 Accepted: 1102DescriptionRecently your team noticed that the computer you use to practice for programming con原创 2016-07-06 10:22:06 · 631 阅读 · 0 评论 -
POJ 1511 Invitation Cards(SPFA)
Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 25322 Accepted: 8383DescriptionIn the age of television, not many people attend theater p原创 2016-08-25 10:05:02 · 455 阅读 · 0 评论 -
POJ 1364 King(差分约束系统)
KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12452 Accepted: 4521DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a原创 2016-10-07 16:17:49 · 388 阅读 · 0 评论 -
POJ 2391 Ombrophobic Bovines(floyd+二分+最大流+拆点)
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18605 Accepted: 4049DescriptionFJ's cows really hate getting wet so much that the mere原创 2016-12-14 21:02:42 · 338 阅读 · 0 评论 -
POJ 1637 Sightseeing tour(混和图欧拉回路判断)
Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9262 Accepted: 3914DescriptionThe city executive board in Lund wants to construct a sights原创 2016-12-17 21:20:13 · 400 阅读 · 0 评论 -
POJ 3308 Paratroopers(最小割+对数降级)
ParatroopersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8549 Accepted: 2588DescriptionIt is year 2500 A.D. and there is a terrible war between the f原创 2017-01-13 19:13:27 · 626 阅读 · 0 评论 -
POJ 1930 Dead Fraction (无限循环小数转化为分数)
Dead FractionTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2597 Accepted: 845DescriptionMike is frantically scrambling to finish his thesis at the last原创 2016-07-15 16:23:40 · 535 阅读 · 0 评论 -
POJ 3687 Labeling Balls(拓扑排序+反向思考)
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13776 Accepted: 3983DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2016-08-21 20:06:01 · 451 阅读 · 0 评论 -
POJ 1422 && ZOJ 1525 Air Raid(有向图最小路径覆盖)
Air RaidTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8127 Accepted: 4865DescriptionConsider a town where all the streets are one-way and each street原创 2017-02-08 18:13:47 · 527 阅读 · 0 评论 -
POJ 1678 I Love this Game!(博弈DP)
I Love this Game!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2136 Accepted: 819DescriptionA traditional game is played between two players on a pool o原创 2016-09-02 20:22:22 · 395 阅读 · 0 评论 -
POJ 3420 Quad Tiling(轮廓线DP+矩阵快速幂)
Quad TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4076 Accepted: 1856DescriptionTired of the Tri Tiling game finally, Michael turns to a more原创 2016-08-24 09:44:15 · 1142 阅读 · 1 评论 -
POJ 2987 Firing (最大权闭合图)
FiringTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 9823 Accepted: 2955DescriptionYou’ve finally got mad at “the world’s most stupid” employees of yo原创 2016-07-25 08:54:02 · 510 阅读 · 0 评论 -
POJ 3421 X-factor Chains (整数分解+组合数)
X-factor ChainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6496 Accepted: 2018DescriptionGiven a positive integer X, an X-factor chain of length原创 2016-07-15 21:20:01 · 847 阅读 · 0 评论 -
POJ 1912 A highway and the seven dwarfs(O(log N)求直线与凸包是否相交)
A highway and the seven dwarfsTime Limit: 8000MS Memory Limit: 30000KTotal Submissions: 2454 Accepted: 485Case Time Limit: 3000MSDescriptionOnce upon a time,原创 2016-08-07 16:14:43 · 605 阅读 · 0 评论 -
POJ 3608 Bridge Across Islands(求两凸包间的最小距离)
Bridge Across IslandsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10108 Accepted: 2969 Special JudgeDescriptionThousands of thousands years ago t原创 2016-08-07 20:00:31 · 1122 阅读 · 7 评论 -
POJ 2978 Colored stones(状压DP+逆向思维)
Colored stonesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1887 Accepted: 882DescriptionYou are given a row of m stones each of which has one of k di原创 2016-09-09 16:15:57 · 525 阅读 · 0 评论 -
POJ 2079 Triangle 题解 《挑战程序设计竞赛》
原文地址POJ 2079 Triangle凸包三角:求N个点组成的三角形的最大面积?3.6与平面和空间打交道的计算几何 凸包 不难想到最大三角形一定由凸包的顶点构成,难点在于怎么搜索。O(N^3)枚举会超时,旋转卡壳法O(N^2)解决问题。如图,先固定一条边(红色实线),然后搜索下一个顶点1st,三角形面积必然是先增后减的(极值在固定边的法线方向的最远点转载 2016-08-08 16:42:57 · 479 阅读 · 0 评论 -
POJ 1236 Network of Schools(使DAG强联通最小加边数)
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15788 Accepted: 6255DescriptionA number of schools are connected to a computer network.原创 2016-08-09 09:34:51 · 659 阅读 · 0 评论 -
ZOJ 1136&&POJ 1465 Multiple(BFS+同余定理)
MultipleTime Limit: 1000MS Memory Limit: 32768KTotal Submissions: 7215 Accepted: 1546Descriptiona program that, given a natural number N between 0 and 4999 (inclusi原创 2016-08-17 20:04:49 · 651 阅读 · 0 评论 -
POJ 3692 Kindergarten (补图+最大独立集)
KindergartenTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6313 Accepted: 3104DescriptionIn a kindergarten, there are a lot of kids. All girls of the原创 2016-07-28 08:31:56 · 709 阅读 · 0 评论