2009年10月16日
POJ 1850, Code
摘要： Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 3153Accepted: 1414DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the a... 阅读全文
posted @ 2009-10-16 06:33 Weiyu Wang 阅读(768) 评论(0) 推荐(0) 编辑
POJ 3252, Round Numbers
摘要： Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 2812Accepted: 877DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as... 阅读全文
posted @ 2009-10-16 05:13 Weiyu Wang 阅读(1166) 评论(1) 推荐(0) 编辑
2009年10月14日
POJ 1159, Palindrome
摘要： Time Limit: 3000MSMemory Limit: 65536KTotal Submissions: 26714Accepted: 8915DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right... 阅读全文
posted @ 2009-10-14 12:09 Weiyu Wang 阅读(782) 评论(0) 推荐(0) 编辑
POJ 1080, Human Gene Functions
摘要： Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8125Accepted: 4497DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simp... 阅读全文
posted @ 2009-10-14 11:05 Weiyu Wang 阅读(784) 评论(0) 推荐(0) 编辑
2009年10月13日
POJ 3176, Cow Bowling
摘要： Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5823Accepted: 3802DescriptionThe cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though... 阅读全文
posted @ 2009-10-13 13:25 Weiyu Wang 阅读(480) 评论(0) 推荐(0) 编辑
POJ 2533, Longest Ordered Subsequence
摘要： Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 12078Accepted: 5098DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequ... 阅读全文
posted @ 2009-10-13 12:29 Weiyu Wang 阅读(853) 评论(0) 推荐(0) 编辑
POJ 1260, Pearls
摘要： Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 2595Accepted: 1198DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pear... 阅读全文
posted @ 2009-10-13 12:18 Weiyu Wang 阅读(640) 评论(0) 推荐(0) 编辑
POJ 1836, Alignment
摘要： Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 3283Accepted: 963DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a stra... 阅读全文
posted @ 2009-10-13 10:59 Weiyu Wang 阅读(774) 评论(0) 推荐(0) 编辑
POJ 3267, The Cow Lexicon
摘要： Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 2856Accepted: 1252DescriptionFew know that the cows have their own dictionary with W (1 ≤ W ≤ 600) words, each containing no more 2... 阅读全文
posted @ 2009-10-13 09:34 Weiyu Wang 阅读(965) 评论(1) 推荐(0) 编辑
用匈牙利算法求二分图的最大匹配（转载）
摘要： from http://imlazy.ycool.com/post.1603708.html 什么是二分图，什么是二分图的最大匹配，这些定义我就不讲 了，网上随便都找得到。二分图的最大匹配有两种求法，第一种是最大流（我在此假设读者已有网络流的知识）；第二种就是我现在要讲的匈牙利算法。这个算法说 白了就是最大流的算法，但是它跟据二分图匹配这个问题的特点，把最大流算法做了简化，提高了效率。匈牙利算法其... 阅读全文
posted @ 2009-10-13 07:24 Weiyu Wang 阅读(740) 评论(0) 推荐(0) 编辑