摘要：
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... 阅读全文
摘要：
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... 阅读全文
摘要：
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... 阅读全文
摘要：
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... 阅读全文
摘要：
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... 阅读全文
摘要：
from http://imlazy.ycool.com/post.1603708.html 什么是二分图，什么是二分图的最大匹配，这些定义我就不讲 了，网上随便都找得到。二分图的最大匹配有两种求法，第一种是最大流（我在此假设读者已有网络流的知识）；第二种就是我现在要讲的匈牙利算法。这个算法说 白了就是最大流的算法，但是它跟据二分图匹配这个问题的特点，把最大流算法做了简化，提高了效率。匈牙利算法其... 阅读全文
摘要：
Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9109Accepted: 3052DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a re... 阅读全文