kuangbin - 博客园

HDU 2389 Rain on your Parade（二分匹配，Hopcroft-Carp算法）

摘要： Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 2154Accepted Submission(s): 662Problem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sun 阅读全文

posted @ 2013-07-29 22:49 kuangbin 阅读(1427) 评论(0) 推荐(0)

HDU 3360 National Treasures（二分匹配，最小点覆盖）

摘要： National TreasuresTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 871Accepted Submission(s): 291Problem DescriptionThe great hall of the national museum has been robbed few times recently. Everyone is now worried about the security of the treasures 阅读全文

posted @ 2013-07-29 09:57 kuangbin 阅读(650) 评论(0) 推荐(0)

POJ 3608 Bridge Across Islands（旋转卡壳，两凸包最短距离）

摘要： Bridge Across IslandsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7202Accepted:2113Special JudgeDescriptionThousands of thousands years ago there was a small kingdom located in the middle of the Pacific Ocean. The territory of the kingdom consists two separated islands. Due to the impact of 阅读全文

posted @ 2013-07-28 22:05 kuangbin 阅读(1265) 评论(0) 推荐(0)

POJ 2079 Triangle（凸包+旋转卡壳，求最大三角形面积）

摘要： TriangleTime Limit:3000MSMemory Limit:30000KTotal Submissions:7625Accepted:2234DescriptionGiven n distinct points on a plane, your task is to find the triangle that have the maximum area, whose vertices are from the given points.InputThe input consists of several test cases. The first line of each t 阅读全文

posted @ 2013-07-28 18:51 kuangbin 阅读(1230) 评论(0) 推荐(0)

POJ 2187 Beauty Contest （求最远点对，凸包+旋转卡壳）

摘要： Beauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:24283Accepted:7420DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 #include #include #inclu 阅读全文

posted @ 2013-07-28 17:46 kuangbin 阅读(1435) 评论(0) 推荐(0)

HDU 4305 Lightning（计算几何，判断点在线段上，生成树计数）

摘要： LightningTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1099Accepted Submission(s): 363Problem DescriptionThere are N robots standing on the ground (Don't know why. Don't know how).Suddenly the sky turns into gray, and lightning storm come 阅读全文

posted @ 2013-07-27 16:28 kuangbin 阅读(1450) 评论(0) 推荐(0)

HDU 1845 Jimmy’s Assignment（二分匹配）

摘要： Jimmy’s AssignmentTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 464Accepted Submission(s): 224Problem DescriptionJimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special 阅读全文

posted @ 2013-07-27 10:52 kuangbin 阅读(884) 评论(0) 推荐(0)

HDU 1507 Uncle Tom's Inherited Land*（二分匹配，输出任意一组解）

摘要： Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1247Accepted Submission(s): 542Special JudgeProblem DescriptionYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been 阅读全文

posted @ 2013-07-27 10:09 kuangbin 阅读(1465) 评论(4) 推荐(1)

HDU 3537 Daizhenyang's Coin（博弈，翻硬币）

摘要： Daizhenyang's CoinTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 183Accepted Submission(s): 83Problem DescriptionWe know that Daizhenyang is chasing a girlfriend. As we all know, whenever you chase a beautiful girl, there'll always be an o 阅读全文

posted @ 2013-07-26 21:11 kuangbin 阅读(1503) 评论(0) 推荐(0)

【转】博弈-翻硬币游戏

摘要：翻硬币游戏一般的翻硬币游戏的规则是这样的：N枚硬币排成一排，有的正面朝上，有的反面朝上。我们从左开始对硬币按1到N编号。第一，游戏者根据某些约束翻硬币，但他所翻动的硬币中，最右边那个硬币的必须是从正面翻到反面。例如，只能翻3个硬币的情况，那么第三个硬币必须是从正面翻到反面。如果局面是正正反，那就不能翻硬币了，因为第三个是反的。第二，谁不能翻谁输。有这样的结论：局面的SG值为局面中每个正面朝上的棋子单一存在时的SG值的异或和。即一个有k个硬币朝上，朝上硬币位置分布在的翻硬币游戏中，SG值是等于k个独立的开始时只有一个硬币朝上的翻硬币游戏的SG值异或和。比如THHTTH这个游戏中，2号、3号、6号阅读全文

posted @ 2013-07-26 21:09 kuangbin 阅读(5264) 评论(1) 推荐(6)