07 2013 档案

hdu 4617 Weapon【异面直线距离——基础三维几何】
摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=4617WeaponTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 224Accepted Submission(s): 178Problem Description Doctor D. are researching for a horrific weapon. The muzzle of the weapon is a circle. When it. 阅读全文
posted @ 2013-07-31 20:02 free斩 阅读(288) 评论(0) 推荐(0)
POJ 3026 Borg Maze【BFS+最小生成树】
摘要：链接：http://poj.org/problem?id=3026http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22010#problem/JBorg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:6905Accepted:2315DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Bor 阅读全文
posted @ 2013-07-31 15:06 free斩 阅读(210) 评论(0) 推荐(0)
POJ 1789 Truck History【最小生成树简单应用】
摘要：链接：http://poj.org/problem?id=1789http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22010#problem/GTruck HistoryTime Limit:2000MSMemory Limit:65536KTotal Submissions:14950Accepted:5714DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable deliv 阅读全文
posted @ 2013-07-31 09:52 free斩 阅读(267) 评论(0) 推荐(0)
POJ 2485 Highways【最小生成树最大权——简单模板】
摘要：链接：http://poj.org/problem?id=2485http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22010#problem/HHighwaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:18668Accepted:8648DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the tra 阅读全文
posted @ 2013-07-31 08:42 free斩 阅读(324) 评论(0) 推荐(0)
hdu 4627 The Unsolvable Problem【hdu2013多校3签到】
摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=4627The Unsolvable ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 243Accepted Submission(s): 143Problem DescriptionThere are many unsolvable problem in the world.It could be about one or about ze 阅读全文
posted @ 2013-07-30 20:59 free斩 阅读(139) 评论(0) 推荐(0)
POJ 1039 Pipe【经典线段与直线相交】
摘要：链接：http://poj.org/problem?id=1039http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/BPipeTime Limit:1000MSMemory Limit:10000KTotal Submissions:8350Accepted:2501DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the 阅读全文
posted @ 2013-07-30 20:43 free斩 阅读(315) 评论(0) 推荐(0)
POJ 1408 Fishnet【枚举+线段相交+叉积求面积】
摘要：题目：http://poj.org/problem?id=1408http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/CFishnetTime Limit:1000MSMemory Limit:10000KTotal Submissions:1604Accepted:1026DescriptionA fisherman named Etadokah awoke in a very small island. He could see calm, beautiful and blue sea around the 阅读全文
posted @ 2013-07-30 10:08 free斩 阅读(190) 评论(0) 推荐(0)
POJ 1694 An Old Stone Game【递归+排序】
摘要：链接：http://poj.org/problem?id=1694http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/EAn Old Stone GameTime Limit:1000MSMemory Limit:10000KTotal Submissions:3132Accepted:1422DescriptionThere is an old stone game, played on an arbitrary general tree T. The goal is to put one stone on 阅读全文
posted @ 2013-07-29 15:38 free斩 阅读(262) 评论(0) 推荐(0)
POJ 2092 Grandpa is Famous【水---找出现第二多的数】
摘要：链接：http://poj.org/problem?id=2092http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/DGrandpa is FamousTime Limit:2000MSMemory Limit:30000KTotal Submissions:7210Accepted:3650DescriptionThe whole family was excited by the news. Everyone knew grandpa had been an extremely good bridge p 阅读全文
posted @ 2013-07-29 14:10 free斩 阅读(271) 评论(0) 推荐(0)
POJ 2993 Emag eht htiw Em Pleh【模拟画棋盘】
摘要：链接：http://poj.org/problem?id=2993http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/CEmag eht htiw Em PlehTime Limit:1000MSMemory Limit:65536KTotal Submissions:2280Accepted:1531DescriptionThis problem is a reverse case of theproblem 2996. You are given the output of the problem H an 阅读全文
posted @ 2013-07-29 12:05 free斩 阅读(300) 评论(0) 推荐(0)
POJ 1068 Parencodings【水模拟--数括号】
摘要：链接：http://poj.org/problem?id=1068http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#problem/BParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:17044Accepted:10199DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways:q B 阅读全文
posted @ 2013-07-29 09:07 free斩 阅读(287) 评论(0) 推荐(0)
sgu 1348 Goat in the Garden 2【点到线段的距离】
摘要：链接：http://acm.timus.ru/problem.aspx?space=1&num=1348http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27498#problem/A1348. Goat in the Garden 2Time limit: 1.0 secondMemory limit: 64 MBA goat is tied to a peg (in a pointC) in a garden with a strong rope of the lengthL(i.e. a goat may eat a gr 阅读全文
posted @ 2013-07-28 18:49 free斩 阅读(303) 评论(0) 推荐(0)
POJ 1518 A Round Peg in a Ground Hole【计算几何=_=你值得一虐】
摘要：链接：http://poj.org/problem?id=1584http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/DA Round Peg in a Ground HoleTime Limit:1000MSMemory Limit:10000KTotal Submissions:4475Accepted:1374DescriptionThe DIY Furniture company specializes in assemble-it-yourself furniture kits. Typically, 阅读全文
posted @ 2013-07-28 16:40 free斩 阅读(225) 评论(0) 推荐(0)
POJ 1584 A Round Peg in a Ground Hole【计算几何=_=你值得一虐】
摘要：链接：http://poj.org/problem?id=1584http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/DA Round Peg in a Ground HoleTime Limit:1000MSMemory Limit:10000KTotal Submissions:4475Accepted:1374DescriptionThe DIY Furniture company specializes in assemble-it-yourself furniture kits. Typically, 阅读全文
posted @ 2013-07-28 16:40 free斩 阅读(221) 评论(0) 推荐(0)
sgu Theodore Roosevelt【判断点是否在凸多边形内模板】
摘要：链接：http://acm.sgu.ru/problem.php?contest=0&problem=253http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27464#problem/A253. Theodore Roosevelttime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardDanger! Sudden attack on Russia! These are Americans " 阅读全文
posted @ 2013-07-28 11:00 free斩 阅读(396) 评论(0) 推荐(0)
hdu 2036 改革春风吹满地【求多边形面积模板】
摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=2036http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27459#problem/B改革春风吹满地Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14528Accepted Submission(s): 7374Problem Description“ 改革春风吹满地,不会AC没关系;实在不行回 阅读全文
posted @ 2013-07-28 10:56 free斩 阅读(278) 评论(0) 推荐(0)
hdu 2108 Shape of HDU【判断多边形是否是凸多边形模板】
摘要：链接：http://acm.hdu.edu.cn/showproblem.php?pid=2108http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27459#problem/AShape of HDUTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4320Accepted Submission(s): 1916Problem Description话说上回讲到海东集团推选老总的事情，最 阅读全文
posted @ 2013-07-28 10:52 free斩 阅读(263) 评论(0) 推荐(0)
POJ 2187 Beauty Contest【凸包周长】
摘要：题目：http://poj.org/problem?id=1113http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/FWallTime Limit:1000MSMemory Limit:10000KTotal Submissions:26219Accepted:8738DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's 阅读全文
posted @ 2013-07-27 16:04 free斩 阅读(209) 评论(0) 推荐(0)
POJ 1113 Wall【凸包周长】
摘要：题目：http://poj.org/problem?id=1113http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/FWallTime Limit:1000MSMemory Limit:10000KTotal Submissions:26219Accepted:8738DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's 阅读全文
posted @ 2013-07-27 16:04 free斩 阅读(212) 评论(0) 推荐(0)
POJ 2187 Beauty Contest【旋转卡壳求凸包直径】
摘要：链接：http://poj.org/problem?id=2187http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/EBeauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:24254Accepted:7403DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the 阅读全文
posted @ 2013-07-27 11:21 free斩 阅读(258) 评论(0) 推荐(0)
POJ 2031 Building a Space Station【经典最小生成树】
摘要：链接：http://poj.org/problem?id=2031http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22013#problem/ABuilding a Space StationTime Limit:1000MSMemory Limit:30000KTotal Submissions:3578Accepted:1830DescriptionYou are a member of the space station engineering team, and are assigned a task in the const 阅读全文
posted @ 2013-07-26 16:08 free斩 阅读(245) 评论(0) 推荐(0)
URAL 1181 Cutting a Painted Polygon【递归+分治】
摘要：题目：http://acm.timus.ru/problem.aspx?space=1&num=1181http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/A1181. Cutting a Painted PolygonTime limit: 1.0 secondMemory limit: 64 MBThere is a convex polygon with vertices painted in three colors: Red (R), Green (G) and Blue (B). It is 阅读全文
posted @ 2013-07-25 19:27 free斩 阅读(240) 评论(0) 推荐(0)
谷歌代理设置
摘要：图文链接地址：http://blog.chinaunix.net/uid-191945-id-3383080.htmlchorme导入SwitchySharp配置地址：chrome-extension://dpplabbmogkhghncfbfdeeokoefdjegm/options.html?firstTime 阅读全文
posted @ 2013-07-25 10:31 free斩 阅读(109) 评论(0) 推荐(0)
POJ 1845-Sumdiv【经典数学题目---求因子和】
摘要：转载请注明出处：http://blog.csdn.net/lyy289065406/article/details/6648539優YoUhttp://user.qzone.qq.com/289065406/blog/1309237394大致题意：求A^B的所有约数（即因子）之和，并对其取模 9901再输出。解题思路：要求有较强 数学思维 的题应用定理主要有三个：要求有较强 数学思维 的题应用定理主要有三个：（1） 整数的唯一分解定理： 任意正整数都有且只有一种方式写出其素因子的乘积表达式。 A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 其中pi均为素数（2） 阅读全文
posted @ 2013-07-24 23:47 free斩 阅读(266) 评论(0) 推荐(0)
博弈知识汇总
摘要：博弈知识汇总有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿走 阅读全文
posted @ 2013-07-24 22:43 free斩 阅读(149) 评论(0) 推荐(0)
hdu 4068 I-number【大数】
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=4608http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/G2013暑期多校联合训练——80+高校，300+队伍，10000元奖金，敬请期待~I-numberTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1006Accepted Submission(s): 398P 阅读全文
posted @ 2013-07-24 16:52 free斩 阅读(154) 评论(0) 推荐(0)
poj 3714 Raid【(暴力+剪枝) || （分治法+剪枝）】
摘要：题目：http://poj.org/problem?id=3714http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/DRaidTime Limit:5000MSMemory Limit:65536KTotal Submissions:7355Accepted:2185DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last stronghold. Dependi 阅读全文
posted @ 2013-07-24 16:34 free斩 阅读(429) 评论(0) 推荐(0)
zoj 3356 Football Gambling II【枚举+精度问题】
摘要：题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3356http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26732#problem/DFootball Gambling IITime Limit:3 Seconds Memory Limit:65536 KBThe 2010 FIFA World Cup toke place between 11 June and 11 July 2010 in South Africa. Being a non-fans 阅读全文
posted @ 2013-07-23 17:01 free斩 阅读(239) 评论(0) 推荐(0)
[置顶] 2013_CSUST暑假训练总结
摘要：2013-7-19shu 新生训练赛：母函数【转换成了背包做的】 shuacm题目：http://acm.hdu.edu.cn/diy/contest_show.php?cid=20083总结：http://blog.csdn.net/cfreezhan/article/details/93851832013-7-20上午 9 点 —— 下午 2 点湖大第六次训练赛：【1题】HNU_训练赛6【来源zoj月赛】总结：A：zoj 3716 Ribbon Gymnastics【神奇的计算几何】晚上 7点半 —— 晚上 十一点半2013-暑假CSUST训练第一场：CSUST7月20号总结：APOJ 1 阅读全文
posted @ 2013-07-22 21:49 free斩 阅读(216) 评论(0) 推荐(0)
ural 1303 Minimal Coverage【贪心】
摘要：链接：http://acm.timus.ru/problem.aspx?space=1&num=1303http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26733#problem/DD -Minimal CoverageTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1303DescriptionGiven set of line segments [Li, Ri] with integ 阅读全文
posted @ 2013-07-22 21:07 free斩 阅读(383) 评论(0) 推荐(0)
sgu 195 New Year Bonus Grant【简单贪心】
摘要：链接：http://acm.sgu.ru/problem.php?contest=0&problem=195http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26733#problem/E195. New Year Bonus Granttime limit per test: 1.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardAll programmers ofMocrosoftsoftware company are organized 阅读全文
posted @ 2013-07-22 14:58 free斩 阅读(247) 评论(0) 推荐(0)
POJ 286 Y2K Accounting Bug【简单暴力】
摘要：链接：http://poj.org/problem?id=2586http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26733#problem/CY2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:8472Accepted:4185DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data f 阅读全文
posted @ 2013-07-22 14:00 free斩 阅读(216) 评论(0) 推荐(0)
POJ 2856 Y2K Accounting Bug【简单暴力】
摘要：链接：http://poj.org/problem?id=2586http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26733#problem/CY2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:8472Accepted:4185DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data f 阅读全文
posted @ 2013-07-22 14:00 free斩 阅读(244) 评论(0) 推荐(0)
URAL 1010 Discrete Function【简单暴力】
摘要：链接:http://acm.timus.ru/problem.aspx?space=1&num=1010http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26732#problem/EE -Discrete FunctionTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1010DescriptionThere is a discrete function. It is specified 阅读全文
posted @ 2013-07-22 13:42 free斩 阅读(230) 评论(0) 推荐(0)
POJ 2965 The Pilots Brothers' refrigerator【枚举+dfs】
摘要：题目:http://poj.org/problem?id=2965来源:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26732#problem/B题意:就是把题目中给出的状态图,全部翻转成----------------状态翻转: 每次翻转一个,那么它所在的行和列都要翻转问最小翻转次数,同时输出翻转路径.算法:暴力 + 枚举 + dfs思路:可以证明每个把手要么翻转,要么不翻转,那么从左到右,从上到下依次枚举每个把手,同时深搜一遍即可。和前面的棋盘翻转一样.[POJ 1753 Flip Game] 做了棋盘翻转都纠结了半天才出了这 阅读全文
posted @ 2013-07-22 12:19 free斩 阅读(165) 评论(0) 推荐(0)
zoj 2362 Beloved Sons【二分匹配】
摘要：题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2361来源：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26760#problem/BBeloved SonsTime Limit:2 Seconds Memory Limit:65536 KB Special JudgeOnce upon a time there lived a king and he had N sons. And the king wanted to marry his belo 阅读全文
posted @ 2013-07-21 14:39 free斩 阅读(169) 评论(0) 推荐(0)
zoj 3721 Final Exam Arrangement【贪心】
摘要：题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3721来源：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26644#problem/FFinal Exam ArrangementTime Limit:4 Seconds Memory Limit:65536 KB Special JudgeIn Zhejiang University, there areNdifferent courses labeled from 1 toN. Each cours 阅读全文
posted @ 2013-07-20 18:14 free斩 阅读(370) 评论(0) 推荐(0)
zoj 3716 Ribbon Gymnastics【神奇的计算几何】
摘要：题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3716来源：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26644#problem/ARibbon GymnasticsTime Limit:2 Seconds Memory Limit:65536 KB Special JudgeRobert is a gymnastics coach. Unfortunately, he got four gymnastics beginners to attend 阅读全文
posted @ 2013-07-20 17:47 free斩 阅读(250) 评论(0) 推荐(0)
shu7-19【背包和母函数练习】
摘要：题目：http://acm.hdu.edu.cn/diy/contest_show.php?cid=20083密码：shuacm感觉他们学校的新生训练出的比较好。今天很多题目都是强化了背包的转化。关于背包转化成求最优解见分析：点击打开链接贴个背包的模板：//0-1背包, 代价为 cost, 获得的价值为 weight // 每种物品最多只可以选一次 void ZeroOnePack(int cost, int weight) { for(int i = nValue; i >= cost; i--) dp[i] = dp[i] + dp[i-cost]+weight; ... 阅读全文
posted @ 2013-07-19 20:00 free斩 阅读(248) 评论(0) 推荐(0)
图论500题
摘要：转载来自：http://blog.csdn.net/ffq5050139/article/details/7832991=============================以下是最小生成树+并查集====================================== 【HDU】 1213 How Many Tables 基础并查集★ 1272 小希的迷宫 基础并查集★ 1325&&poj1308 Is It A Tree? 基础并查集★ 1856 More is better 基础并查集★ 1102 Constructing Roads 基础最小... 阅读全文
posted @ 2013-07-18 20:24 free斩 阅读(251) 评论(0) 推荐(0)
网络流初步总结
摘要：查看资料：lrj 《算法竞赛入门经典》相关概念：最大流：（Maximum-Flow Problem） 从源点　S 中间经过一些点，一些的物品运送到汇点 t 。 中途每两点间都有个最大运送物品数。 求从 s 到 t 最多能运送多少物品。 容量： 对于一条边 (u,v),它的物品上限（能够运送的物品最大数量）称为容量 （capacity）， 记为 c(u,v) (对于不存在的边 (u,v) , c(u,v) = 0)流量： 实际运送物品数称为流量 （flow） 规定：f(u,v) 和 f(v,u) 最多只有一个正数（可以均... 阅读全文
posted @ 2013-07-18 15:22 free斩 阅读(187) 评论(0) 推荐(0)
hdu 3549 Flow Problem【最大流增广路入门模板题】
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=3549Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5111Accepted Submission(s): 2385Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is t 阅读全文
posted @ 2013-07-18 12:45 free斩 阅读(203) 评论(0) 推荐(0)
hdu 4414 Finding crosses【简单模拟】
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=4414CSUST:点击打开链接Finding crossesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 729Accepted Submission(s): 411Problem DescriptionThe Nazca Lines are a series of ancient geoglyphs located in the Nazca Dese 阅读全文
posted @ 2013-07-17 21:16 free斩 阅读(207) 评论(0) 推荐(0)