07 2013 档案

广度优先搜索（BFS）
摘要：广度优先搜索算法（Breadth-First-Search），又译作宽度优先搜索，或横向优先搜索，简称BFS，是一种图形搜索算法。简单的说，BFS是从根节点开始，沿着树的宽度遍历树的节点。如果所有节点均被访问，则算法中止。原理：从算法的观点，所有因为展开节点而得到的子节点都会被加进一个先进先出的队列... 阅读全文
posted @ 2013-07-31 23:46 InkGenius 阅读(1032) 评论(0) 推荐(0)
POJ 1503 Integer Inquiry(大数相加)
摘要：一、DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he ... 阅读全文
posted @ 2013-07-31 22:19 InkGenius 阅读(167) 评论(0) 推荐(0)
Poj1062 昂贵的聘礼 （dijkstra算法）
摘要：一、Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶... 阅读全文
posted @ 2013-07-30 20:00 InkGenius 阅读(217) 评论(0) 推荐(0)
Poj 1067 取石子游戏（NIM,威佐夫博奕）
摘要：一、Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问... 阅读全文
posted @ 2013-07-28 15:19 InkGenius 阅读(235) 评论(0) 推荐(0)
Poj 2853,2140 Sequence Sum Possibilities(因式分解)
摘要：一、DescriptionMost positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,6 = 1 + 2 + 39 =... 阅读全文
posted @ 2013-07-27 17:14 InkGenius 阅读(211) 评论(0) 推荐(0)
poj 1519 Digital Roots (计算根数字)
摘要：一、DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that ... 阅读全文
posted @ 2013-07-27 17:03 InkGenius 阅读(191) 评论(0) 推荐(0)
Poj 2503 Babelfish(Map操作)
摘要：一、DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, yo... 阅读全文
posted @ 2013-07-25 23:21 InkGenius 阅读(140) 评论(0) 推荐(0)
Poj 1936,3302 Subsequence(LCS)
摘要：一、Description（3302）Given a string s of length n, a subsequence of it, is defined as another strings' = su1su2...sum where 1 ≤u1 z[i][j-1] ?z[i-1][j]:... 阅读全文
posted @ 2013-07-25 22:45 InkGenius 阅读(206) 评论(0) 推荐(0)
LCS(最长公共子序列问题)
摘要：LCS(Longest Common Subsequence)，即最长公共子序列。一个序列，如果是两个或多个已知序列的子序列，且是所有子序列中最长的，则为最长公共子序列。原理： 事实上，最长公共子序列问题也有最优子结构性质。然后，用动态规划的方法找到状态转换方程。 记:Xi=﹤x1，⋯，xi... 阅读全文
posted @ 2013-07-25 22:40 InkGenius 阅读(219) 评论(0) 推荐(0)
Poj 1125 Stockbroker Grapevine(Floyd算法求结点对的最短路径问题)
摘要：一、DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stoc... 阅读全文
posted @ 2013-07-25 18:06 InkGenius 阅读(196) 评论(0) 推荐(0)
Floyd-Warshall算法：求结点对的最短路径问题
摘要：Floyd-Warshall算法：是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。原理：Floyd-Warshall算法的原理是动态规划（DP）。设D_{i,j,k}为从i到j的只以(1..k)集合中的节点为中间节点的最短路径的长度。若... 阅读全文
posted @ 2013-07-25 17:46 InkGenius 阅读(429) 评论(0) 推荐(0)
Floyd-Warshall算法：求结点对的最短路径问题
摘要：Floyd-Warshall算法：是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。原理：Floyd-Warshall算法的原理是动态规划（DP）。设D_{i,j,k}为从i到j的只以(1..k)集合中的节点为中间节点的最短路径的长度。若... 阅读全文
posted @ 2013-07-25 17:46 InkGenius 阅读(136) 评论(0) 推荐(0)
poj 1208 Web Navigation(堆栈操作)
摘要：一、DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features... 阅读全文
posted @ 2013-07-24 11:00 InkGenius 阅读(174) 评论(0) 推荐(0)
poj 1208 Web Navigation(堆栈操作)
摘要：一、DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features... 阅读全文
posted @ 2013-07-24 11:00 InkGenius 阅读(255) 评论(0) 推荐(0)
poj 1273 Drainage Ditches（最大流，E-K算法）
摘要：一、DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by w... 阅读全文
posted @ 2013-07-23 19:16 InkGenius 阅读(179) 评论(0) 推荐(0)
Poj 1458 Common Subsequence(LCS)
摘要：一、DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequen... 阅读全文
posted @ 2013-07-23 10:47 InkGenius 阅读(149) 评论(0) 推荐(0)
Poj 1458 Common Subsequence(LCS)
摘要：一、DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequen... 阅读全文
posted @ 2013-07-23 10:47 InkGenius 阅读(124) 评论(0) 推荐(0)
Poj 1552 Doubles(水题)
摘要：一、DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integer... 阅读全文
posted @ 2013-07-22 19:00 InkGenius 阅读(159) 评论(0) 推荐(0)
poj 2105 IP Address(水题)
摘要：一、DescriptionSuppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequence of... 阅读全文
posted @ 2013-07-22 17:58 InkGenius 阅读(206) 评论(0) 推荐(0)
poj 1517 u Calculate e(精度控制+水题)
摘要：一、DescriptionA simple mathematical formula for e is e=Σ0<=i<=n1/i!where n is allowed to go to infinity. This can actually yield very accurate approxim... 阅读全文
posted @ 2013-07-22 17:05 InkGenius 阅读(153) 评论(0) 推荐(0)
poj 1658 Eva's Problem(水题)
摘要：一、DescriptionEva的家庭作业里有很多数列填空练习。填空练习的要求是：已知数列的前四项，填出第五项。因为已经知道这些数列只可能是等差或等比数列，她决定写一个程序来完成这些练习。Input第一行是数列的数目t（0 <= t <= 20）。以下每行均包含四个整数，表示数列的前四项。约定数列的... 阅读全文
posted @ 2013-07-22 16:27 InkGenius 阅读(229) 评论(0) 推荐(0)
Poj 2017 Speed Limit(水题)
摘要：一、DescriptionBill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how many miles they have driven. Fortuna... 阅读全文
posted @ 2013-07-22 16:05 InkGenius 阅读(129) 评论(0) 推荐(0)
Poj 1316 Self Numbers(水题)
摘要：一、DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n)... 阅读全文
posted @ 2013-07-22 11:34 InkGenius 阅读(189) 评论(0) 推荐(0)
Poj 1017 Packets(贪心策略)
摘要：一、题目大意： 一个工厂生产的产品用正方形的包裹打包，包裹有相同的高度h和1*1, 2*2, 3*3, 4*4, 5*5, 6*6的尺寸。这些产品经常以产品同样的高度h和6*6的尺寸包袱包装起来运送给客户。工厂和客户最关心的就是尽量使用少的包裹来运送客户定的产品以减少费用。一个能计算运送产品所需最少... 阅读全文
posted @ 2013-07-21 15:38 InkGenius 阅读(179) 评论(0) 推荐(0)
Poj 1017 Packets(贪心策略)
摘要：一、题目大意： 一个工厂生产的产品用正方形的包裹打包，包裹有相同的高度h和1*1, 2*2, 3*3, 4*4, 5*5, 6*6的尺寸。这些产品经常以产品同样的高度h和6*6的尺寸包袱包装起来运送给客户。工厂和客户最关心的就是尽量使用少的包裹来运送客户定的产品以减少费用。一个能计算运送产品所需最少... 阅读全文
posted @ 2013-07-21 15:38 InkGenius 阅读(275) 评论(0) 推荐(0)
Poj 2662，2909 Goldbach's Conjecture （素数判定）
摘要：一、DescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Ev... 阅读全文
posted @ 2013-07-21 11:11 InkGenius 阅读(143) 评论(0) 推荐(0)
Poj 2662，2909 Goldbach's Conjecture （素数判定）
摘要：一、DescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Ev... 阅读全文
posted @ 2013-07-21 11:11 InkGenius 阅读(168) 评论(0) 推荐(0)
poj 2388 Who's in the Middle（快速排序求中位数）
摘要：一、DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as m... 阅读全文
posted @ 2013-07-19 20:57 InkGenius 阅读(146) 评论(0) 推荐(0)
poj 2388 Who's in the Middle（快速排序求中位数）
摘要：一、DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as m... 阅读全文
posted @ 2013-07-19 20:57 InkGenius 阅读(796) 评论(0) 推荐(0)
poj 2000 Gold Coins(水题)
摘要：一、DescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two... 阅读全文
posted @ 2013-07-19 20:27 InkGenius 阅读(163) 评论(0) 推荐(0)
poj 2000 Gold Coins(水题)
摘要：一、DescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two... 阅读全文
posted @ 2013-07-19 20:27 InkGenius 阅读(241) 评论(0) 推荐(0)
POJ 1664 放苹果（递归或DP）
摘要：一、Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。Output... 阅读全文
posted @ 2013-07-19 14:56 InkGenius 阅读(133) 评论(0) 推荐(0)
POJ 1664 放苹果（递归或DP）
摘要：一、Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。Output... 阅读全文
posted @ 2013-07-19 14:56 InkGenius 阅读(201) 评论(0) 推荐(0)
POJ 1046 Color Me Less(浅水)
摘要：一、DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform jus... 阅读全文
posted @ 2013-07-19 10:58 InkGenius 阅读(153) 评论(0) 推荐(0)
POJ 1046 Color Me Less(浅水)
摘要：一、DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform jus... 阅读全文
posted @ 2013-07-19 10:58 InkGenius 阅读(155) 评论(0) 推荐(0)
POJ 2017 No Brainer(超级水题)
摘要：一、DescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets.The following n lines ... 阅读全文
posted @ 2013-07-19 09:40 InkGenius 阅读(228) 评论(0) 推荐(0)
POJ 2017 No Brainer(超级水题)
摘要：一、DescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets.The following n lines ... 阅读全文
posted @ 2013-07-19 09:40 InkGenius 阅读(135) 评论(0) 推荐(0)
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要：一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(174) 评论(0) 推荐(0)
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要：一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(186) 评论(0) 推荐(0)
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要：一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(149) 评论(0) 推荐(0)
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要：一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(143) 评论(0) 推荐(0)
Poj1050_To the Max(二维数组最大字段和)
摘要：一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(129) 评论(0) 推荐(0)
Poj1050_To the Max(二维数组最大字段和)
摘要：一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(165) 评论(0) 推荐(0)
Poj 2602 Superlong sums(大数相加)
摘要：一、DescriptionThe creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers ... 阅读全文
posted @ 2013-07-17 11:44 InkGenius 阅读(174) 评论(0) 推荐(0)
Poj 2602 Superlong sums(大数相加)
摘要：一、DescriptionThe creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers ... 阅读全文
posted @ 2013-07-17 11:44 InkGenius 阅读(163) 评论(0) 推荐(0)
Poj2656(水题)
摘要：一、DescriptionJinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. Howev... 阅读全文
posted @ 2013-07-16 16:02 InkGenius 阅读(106) 评论(0) 推荐(0)
Poj2656(水题)
摘要：一、DescriptionJinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. Howev... 阅读全文
posted @ 2013-07-16 16:02 InkGenius 阅读(151) 评论(0) 推荐(0)
Poj 1061 青蛙的约会(扩展欧几里得解线性同余式）
摘要：一、Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着... 阅读全文
posted @ 2013-07-16 15:03 InkGenius 阅读(193) 评论(0) 推荐(0)
Poj 1061 青蛙的约会(扩展欧几里得解线性同余式）
摘要：一、Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着... 阅读全文
posted @ 2013-07-16 15:03 InkGenius 阅读(162) 评论(0) 推荐(0)
Poj1163 The Triangle(动态规划求最大权值的路径)
摘要：一、Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum ... 阅读全文
posted @ 2013-07-15 17:57 InkGenius 阅读(315) 评论(0) 推荐(0)
Poj1163 The Triangle(动态规划求最大权值的路径)
摘要：一、Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum ... 阅读全文
posted @ 2013-07-15 17:57 InkGenius 阅读(222) 评论(0) 推荐(0)
Poj1258_Agri-Net(最小生成树)
摘要：一、Description(poj1258)Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in ... 阅读全文
posted @ 2013-07-15 16:48 InkGenius 阅读(121) 评论(0) 推荐(0)
Poj1258_Agri-Net(最小生成树)
摘要：一、Description(poj1258)Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in ... 阅读全文
posted @ 2013-07-15 16:48 InkGenius 阅读(104) 评论(0) 推荐(0)
Poj1218_THE DRUNK JAILER(水题)
摘要：一、DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.... 阅读全文
posted @ 2013-07-14 22:11 InkGenius 阅读(167) 评论(0) 推荐(0)
Poj1218_THE DRUNK JAILER(水题)
摘要：一、DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.... 阅读全文
posted @ 2013-07-14 22:11 InkGenius 阅读(161) 评论(0) 推荐(0)
Poj1298_The Hardest Problem Ever(水题)
摘要：一、DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him... 阅读全文
posted @ 2013-07-14 19:43 InkGenius 阅读(147) 评论(0) 推荐(0)
Poj1298_The Hardest Problem Ever(水题)
摘要：一、DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him... 阅读全文
posted @ 2013-07-14 19:43 InkGenius 阅读(191) 评论(0) 推荐(0)
Poj1012_Joseph
摘要：一、DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, ... 阅读全文
posted @ 2013-07-12 12:20 InkGenius 阅读(116) 评论(0) 推荐(0)
Poj1012_Joseph
摘要：一、DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, ... 阅读全文
posted @ 2013-07-12 12:20 InkGenius 阅读(166) 评论(0) 推荐(0)
Poj_1008--Maya Calendar
摘要：一、Description上周末，M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有365天的叫做Haab的历法。这个Haab历法拥有19个月，在开始的18个月，一个月有20天，月份的名字分别是pop, no, zip, zot... 阅读全文
posted @ 2013-07-11 20:55 InkGenius 阅读(166) 评论(0) 推荐(0)
Poj_1008--Maya Calendar
摘要：一、Description上周末，M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有365天的叫做Haab的历法。这个Haab历法拥有19个月，在开始的18个月，一个月有20天，月份的名字分别是pop, no, zip, zot... 阅读全文
posted @ 2013-07-11 20:55 InkGenius 阅读(185) 评论(0) 推荐(0)
Poj 1006 生理周期(中国剩余定理)
摘要：一、Description人生来就有三个生理周期，分别为体力、感情和智力周期，它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天，人会在相应的方面表现出色。例如，智力周期的高峰，人会思维敏捷，精力容易高度集中。因为三个周期的周长不同，所以通常三个周期的高峰不会落在同一天。对... 阅读全文
posted @ 2013-07-11 18:17 InkGenius 阅读(165) 评论(0) 推荐(0)
Poj 1006 生理周期(中国剩余定理)
摘要：一、Description人生来就有三个生理周期，分别为体力、感情和智力周期，它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天，人会在相应的方面表现出色。例如，智力周期的高峰，人会思维敏捷，精力容易高度集中。因为三个周期的周长不同，所以通常三个周期的高峰不会落在同一天。对... 阅读全文
posted @ 2013-07-11 18:17 InkGenius 阅读(170) 评论(0) 推荐(0)
Poj1003
摘要：一、DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (W... 阅读全文
posted @ 2013-07-11 18:17 InkGenius 阅读(102) 评论(0) 推荐(0)
Poj1003
摘要：一、DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (W... 阅读全文
posted @ 2013-07-11 18:17 InkGenius 阅读(85) 评论(0) 推荐(0)
Poj1007_DNA Sorting(面向对象方法)
摘要：一、DescriptionOne measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For ins... 阅读全文
posted @ 2013-07-11 18:15 InkGenius 阅读(172) 评论(0) 推荐(0)
Poj1007_DNA Sorting(面向对象方法)
摘要：一、DescriptionOne measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For ins... 阅读全文
posted @ 2013-07-11 18:15 InkGenius 阅读(193) 评论(0) 推荐(0)
Poj_1088_滑雪(DP)
摘要：一、Description(poj1088)Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面... 阅读全文
posted @ 2013-07-09 17:41 InkGenius 阅读(413) 评论(0) 推荐(0)
Poj_1088_滑雪(DP)
摘要：一、Description(poj1088)Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面... 阅读全文
posted @ 2013-07-09 17:41 InkGenius 阅读(114) 评论(0) 推荐(0)
Poj_1011_Sticks(剪枝)
摘要：一、Description乔治拿来一组等长的木棒，将它们随机地砍断，使得每一节木棍的长度都不超过50个长度单位。然后他又想把这些木棍恢复到为裁截前的状态，但忘记了初始时有多少木棒以及木棒的初始长度。请你设计一个程序，帮助乔治计算木棒的可能最小长度。每一节木棍的长度都用大于零的整数表示。Input输入... 阅读全文
posted @ 2013-07-09 17:40 InkGenius 阅读(178) 评论(0) 推荐(0)
Poj_1011_Sticks(剪枝)
摘要：一、Description乔治拿来一组等长的木棒，将它们随机地砍断，使得每一节木棍的长度都不超过50个长度单位。然后他又想把这些木棍恢复到为裁截前的状态，但忘记了初始时有多少木棒以及木棒的初始长度。请你设计一个程序，帮助乔治计算木棒的可能最小长度。每一节木棍的长度都用大于零的整数表示。Input输入... 阅读全文
posted @ 2013-07-09 17:40 InkGenius 阅读(175) 评论(0) 推荐(0)
Poj_1068 Parencodings
摘要：S (((( )( )() ) ) )P-sequence 4 5 6666,表示第i个右括号的左边有几个左括号。W-sequence 1 1 1456，表示第i个右括号和以它为起点的序列中的第几个左括号配对。问题：已知P序列求W序列。解决：用字符串数组存放括号序列，再通过遍历和多个标号的出W序... 阅读全文
posted @ 2013-07-07 21:56 InkGenius 阅读(117) 评论(0) 推荐(0)
Poj_1068 Parencodings
摘要：S (((( )( )() ) ) )P-sequence 4 5 6666,表示第i个右括号的左边有几个左括号。W-sequence 1 1 1456，表示第i个右括号和以它为起点的序列中的第几个左括号配对。问题：已知P序列求W序列。解决：用字符串数组存放括号序列，再通过遍历和多个标号的出W序... 阅读全文
posted @ 2013-07-07 21:56 InkGenius 阅读(137) 评论(0) 推荐(0)
Poj_1005_I Think I Need A HouseBoat
摘要：一、DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned ... 阅读全文
posted @ 2013-07-07 21:55 InkGenius 阅读(133) 评论(0) 推荐(0)
Poj_1005_I Think I Need A HouseBoat
摘要：一、DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned ... 阅读全文
posted @ 2013-07-07 21:55 InkGenius 阅读(111) 评论(0) 推荐(0)
Poj_1004_FinancialManagement
摘要：一、DescriptionLarry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larry has decided th... 阅读全文
posted @ 2013-07-07 18:05 InkGenius 阅读(87) 评论(0) 推荐(0)
Poj_1004_FinancialManagement
摘要：一、DescriptionLarry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larry has decided th... 阅读全文
posted @ 2013-07-07 18:05 InkGenius 阅读(107) 评论(0) 推荐(0)
Poj_1002_java解决
摘要：一、Description电话号码的标准格式是七位十进制数，并在第三、第四位数字之间有一个连接符。电话拨号盘提供了从字母到数字的映射，映射关系如下：A, B, 和C 映射到 2 D, E, 和F 映射到 3 G, H, 和I 映射到 4 J, K, 和L 映射到 5 M, N, 和O 映射到 6 P... 阅读全文
posted @ 2013-07-06 19:52 InkGenius 阅读(673) 评论(0) 推荐(0)
Poj_1002_java解决
摘要：一、Description电话号码的标准格式是七位十进制数，并在第三、第四位数字之间有一个连接符。电话拨号盘提供了从字母到数字的映射，映射关系如下：A, B, 和C 映射到 2 D, E, 和F 映射到 3 G, H, 和I 映射到 4 J, K, 和L 映射到 5 M, N, 和O 映射到 6 P... 阅读全文
posted @ 2013-07-06 19:52 InkGenius 阅读(137) 评论(0) 推荐(0)
Poj_1045
摘要：这道题难点在于基本物理知识和数学的结合。得出公式后再code,那就是小菜一碟了。import java.util.Scanner;import java.lang.Math;public class N1045 { static double vs; static double r; static ... 阅读全文
posted @ 2013-07-05 15:34 InkGenius 阅读(146) 评论(0) 推荐(0)
Poj_1045
摘要：这道题难点在于基本物理知识和数学的结合。得出公式后再code,那就是小菜一碟了。import java.util.Scanner;import java.lang.Math;public class N1045 { static double vs; static double r; static ... 阅读全文
posted @ 2013-07-05 15:34 InkGenius 阅读(113) 评论(0) 推荐(0)
Java精度计算与舍入
摘要：用到的类： 类 BigDecimal：不可变的、任意精度的有符号十进制数。BigDecimal 由任意精度的整数非标度值 和 32 位的整数标度 (scale) 组成。如果为零或正数，则标度是小数点后的位数。如果为负数，则将该数的非标度值乘以 10 的负 scale 次幂。因此，BigDecimal... 阅读全文
posted @ 2013-07-05 12:06 InkGenius 阅读(196) 评论(0) 推荐(0)
Java精度计算与舍入
摘要：用到的类： 类 BigDecimal：不可变的、任意精度的有符号十进制数。BigDecimal 由任意精度的整数非标度值 和 32 位的整数标度 (scale) 组成。如果为零或正数，则标度是小数点后的位数。如果为负数，则将该数的非标度值乘以 10 的负 scale 次幂。因此，BigDecimal... 阅读全文
posted @ 2013-07-05 12:06 InkGenius 阅读(149) 评论(0) 推荐(0)
java--序列化及其算法透析
摘要：有关Java对象的序列化和反序列化也算是Java基础的一部分，下面对Java序列化的机制和原理进行一些介绍。Java序列化算法透析Serialization（序列化）是一种将对象以一连串的字节描述的过程；反序列化deserialization是一种将这些字节重建成一个对象的过程。Java序列化API... 阅读全文
posted @ 2013-07-04 15:48 InkGenius 阅读(141) 评论(0) 推荐(0)
java--序列化及其算法透析
摘要：有关Java对象的序列化和反序列化也算是Java基础的一部分，下面对Java序列化的机制和原理进行一些介绍。Java序列化算法透析Serialization（序列化）是一种将对象以一连串的字节描述的过程；反序列化deserialization是一种将这些字节重建成一个对象的过程。Java序列化API... 阅读全文
posted @ 2013-07-04 15:48 InkGenius 阅读(141) 评论(0) 推荐(0)