| | | |

2014年7月10日

摘要： #强调从上下文取：session.name等价于session.getAttribute("name");%{}用于计算表达式：%{10+20}结果输出为30；%{#}仍用于计算表达式，只不过操作元可以使变量：%{#age}输出25，等价于%{age}%{#age+10}不能省略#，也就是说变量用于... 阅读全文

posted @ 2014-07-10 11:16 hebozi 阅读(836) 评论(0) 推荐(0)

2012年10月17日

SPFA 算法

摘要：算法简介 SPFA(Shortest Path Faster Algorithm)是Bellman-Ford算法的一种队列实现，减少了不必要的冗余计算。也有人说SPFA本来就是Bellman-Ford算法，现在广为流传的Bellman-Ford算法实际上是山寨版。求单源最短路的SPFA算法的全称是：ShortestPathFasterAlgorithm。从名字我们就可以看出，这种算法在效率上一定有过人之处。很多时候，给定的图存在负权边，这时类似Dijkstra等算法便没有了用武之地，而Bellman-Ford算法的复杂度又过高，SPFA算法便派上用场了。简洁起见，我们约定有向加权图G不存阅读全文

posted @ 2012-10-17 22:01 hebozi 阅读(273) 评论(0) 推荐(0)

poj 3013 Big Christmas Tree SPFA算法

摘要： Big Christmas TreeTime Limit: 3000MSMemory Limit: 131072KTotal Submissions: 17532Accepted: 3702DescriptionChristmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture.The tree can be represente 阅读全文

posted @ 2012-10-17 21:56 hebozi 阅读(164) 评论(0) 推荐(0)

2012年10月15日

poj 2533 Longest Ordered Subsequence

摘要： Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 24375Accepted: 10596DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 < 阅读全文

posted @ 2012-10-15 21:22 hebozi 阅读(158) 评论(0) 推荐(0)

poj 2159 Ancient Cipher

摘要： Ancient CipherTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22180Accepted: 7503DescriptionAncient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form 阅读全文

posted @ 2012-10-15 20:38 hebozi 阅读(189) 评论(0) 推荐(0)

2012年9月20日

poj 2777 Count Color 线段树

摘要： Count ColorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 27842Accepted: 8337DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with length L centimeter, L is a 阅读全文

posted @ 2012-09-20 21:45 hebozi 阅读(146) 评论(0) 推荐(0)

2012年9月19日

poj 1129 Channel Allocation 四色定理

摘要： Channel AllocationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9896Accepted: 5057DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater mus 阅读全文

posted @ 2012-09-19 21:11 hebozi 阅读(212) 评论(0) 推荐(0)

2012年9月18日

poj 1703 Find them, Catch them

摘要： Find them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22213Accepted: 6624DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify 阅读全文

posted @ 2012-09-18 19:58 hebozi 阅读(150) 评论(0) 推荐(0)

2012年9月16日

HDU 4296 Buildings

摘要： BuildingsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 180Accepted Submission(s): 86Problem Description Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accomplished many great projects. 阅读全文

posted @ 2012-09-16 19:53 hebozi 阅读(256) 评论(0) 推荐(0)

2012年9月14日

HDU 1969 Pie 二分查找

摘要： PieTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1591Accepted Submission(s): 552Problem DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various s 阅读全文

posted @ 2012-09-14 20:15 hebozi 阅读(249) 评论(0) 推荐(0)