
ZOJ
synapse7
这个作者很懒,什么都没留下…
展开
-
HDU 1021/ZOJ 2060 Fibonacci Again(数论&整除推导&位运算技巧)
Fibonacci Again http://acm.hdu.edu.cn/showproblem.php?pid=1021 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2060 Time Limit: 2000/1000 MS (Java/Others) Memory Limit原创 2013-08-10 22:07:39 · 1065 阅读 · 0 评论 -
ZOJ 3762 Pan's Labyrinth (点集中的最大点-线距&技巧性枚举)
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3762 思路:(转自这篇文章) 假设拥有最大高的三角形是ABC,如下图 结合此图我们可以看出最大高是点C到直线AB,在这种情况下,下列两个假设至少有一个成立1.点C是所有点中距离点A最远的2.点C是所有点中距离点B最远的 反证:(这里先证明在AB上侧成立的情况原创 2014-03-10 18:59:17 · 1751 阅读 · 2 评论 -
POJ 1651 / ZOJ 1602 / Northeastern Europe 2001 Multiplication Puzzle(dp)
Multiplication Puzzle http://poj.org/problem?id=1651 Time Limit: 1000MS Memory Limit: 65536K Description The multiplication puzzle is played with a row of cards, each contai原创 2013-07-31 14:57:19 · 1348 阅读 · 0 评论 -
POJ 1631 / HDU 1950 / ZOJ 1986 / Northwestern Europe 2003 Bridging signals (DP&LIS)
LIS(最长递增子序列):有一列互不相等数arr[n],从中取出k个数使得lis[k]单调递增,求k的最大值。 读一个数就计算一次。当它是第一个数时,我们就把它存到lis[1]; 当它不是第一个数时,就在lis中查找小于它且离它最近的数lis[i],加到lis中(替换掉lis[i+1]), 找不到的话就说明它最小,我们替换掉lis[1]; 注意两点: 1. 请使用二分查找原创 2013-07-30 16:08:35 · 1469 阅读 · 0 评论 -
ZOJ 3202 Second-price Auction (模拟)
Second-price Auction http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3202 Time Limit: 1 Second Memory Limit: 32768 KB Do you know second-price auction? It's very simple bu原创 2013-08-31 21:37:45 · 1233 阅读 · 0 评论 -
UVa 575 / ZOJ 1712 / Mid-Central USA 1997 Skew Binary (water ver.&斜二进制)
575 - Skew Binary Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=516 When a number is expressed in decimal,原创 2013-09-21 09:55:02 · 1361 阅读 · 0 评论 -
UVa 442/HDU 1082/ZOJ 1094 Matrix Chain Multiplication(模拟&栈)
442 - Matrix Chain Multiplication Time limit: 3.000 seconds Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative,原创 2013-08-02 16:27:23 · 1558 阅读 · 5 评论 -
Beijing 2004 / UVa 1203 / UVALive 3135 / ZOJ 2212 Argus (优先队列)
Argus Time Limit: 2 Seconds Memory Limit: 65536 KB A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial ticker原创 2013-07-25 11:13:16 · 2176 阅读 · 0 评论 -
UVa 439/HDU 1372/POJ 2243/ZOJ 1091 Knight Moves(BFS&纯数学方法)
439 - Knight Moves Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380 http://acm.hdu.edu.cn/showproblem.php?原创 2013-08-03 19:35:48 · 1285 阅读 · 0 评论 -
UVa 10714 / POJ 1852 / ZOJ 2376 Ants (等价转化思想)
10714 - Ants Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1655 An army of ants walk on a horizontal pole o原创 2013-08-04 12:56:38 · 1406 阅读 · 0 评论 -
UVa 10038 / POJ 2575 / ZOJ 1879 Jolly Jumpers (water ver.)
10038 - Jolly Jumpers Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=979 http://poj.org/problem?id=2575 ht原创 2013-09-21 06:13:28 · 1865 阅读 · 0 评论 -
UVa 10282 / POJ 2503 Babelfish / ZOJ 1109 Language of FatMouse (STL&map)
10282 - Babelfish Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1223 http://acm.zju.edu.cn/online原创 2013-07-25 10:45:39 · 1540 阅读 · 0 评论