摘要：
http://poj.org/problem?id=3415Common SubstringsTime Limit:5000MSMemory Limit:65536KTotal Submissions:5805Accepted:1911DescriptionA substring of a stringTis defined as:T(i,k)=TiTi+1...Ti+k-1, 1≤i≤i+k-1≤|T|.Given two stringsA,Band one integerK, we defineS, a set of triples (i,j,k):S= {(i,j,k) |k≥K,A(i 阅读全文
摘要：
http://poj.org/problem?id=3250Bad Hair DayTime Limit:2000MSMemory Limit:65536KTotal Submissions:11473Accepted:3871DescriptionSome of Farmer John'sNcows (1 ≤N≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows 阅读全文
摘要：
http://poj.org/problem?id=2559Largest Rectangle in a HistogramTime Limit:1000MSMemory Limit:65536KTotal Submissions:12297Accepted:3974DescriptionA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different height 阅读全文
摘要：
http://poj.org/problem?id=2406Power StringsTime Limit:3000MSMemory Limit:65536KTotal Submissions:27003Accepted:11311DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of 阅读全文
摘要：
http://poj.org/problem?id=2440DNATime Limit:1000MSMemory Limit:65536KTotal Submissions:3254Accepted:1285DescriptionA kind of virus has attacked the X planet, and many lives are infected. After weeks of study, The CHO (Creature Healthy Organization) of X planet finally finds out that this kind of vir 阅读全文
摘要：
http://ac.nbutoj.com/Problem/view.xhtml?id=1475[1475] Bachelor时间限制: 1000 ms 内存限制: 65535 K问题描述炎热的暑期集训就要结束了，在这短短的20天，大家都很努力，因为很多都是光棍嘛。balabala 所以 Marknoon 先森一直耿耿于怀，毕竟他也是单身嘛。 有一天，Marknoon 先森看着一串数字，发现了那个跟他同命相连的数字1，所以他就开始无聊起来，想知道从数字1到数字N，一共出现了几个1。 例如N=12，则1的个数为5，出现1的数字分别为1,10,11,12。输入输入一个数N(1 2 #include. 阅读全文
摘要：
http://ac.nbutoj.com/Problem/view.xhtml?id=1480[1480] 懒惰的风纪委Elaine时间限制: 1000 ms 内存限制: 65535 K问题描述Elaine是学园都市中的一个风纪委，每天都会接到命令对某个街道进行检查，并抓捕危险分子。她所在的风纪委支部附近有M条街道。这些街道由北到南并排均匀的分布在一条直线上，每条街道之间的距离都为1。但是众所周知，Elaine是一个很懒很懒的人（-..-说我坏话！！被我看到了！！），她不想一步一步走完所有街道，但好在她的好友Kuso为她制作了大量的传送卷轴。不过，因为Kuso的能力等级太低，他制作的卷轴有严重 阅读全文
摘要：
http://ac.nbutoj.com/Problem/view.xhtml?id=1482[1482] 嘛~付钱吧！时间限制: 1000 ms 内存限制: 65535 K问题描述大白菜带着套套去超市买好吃的，到了付钱的时候，收银员告诉大白菜需要付N元。大白菜突然想知道自己付钱有多少种方法，求助我们聪明的ACMER来告诉他，有几种付钱的方法。（已知，我天朝有，红色老人头，绿色老人头，黄色老人头(100,50,20,10,5,1)等等，ps:当大白菜带着套套的时候，他将化身无敌大款，各种老人头要多少有多少）;输入输入的N都是整数（N 2 #include 3 #include 4 #inc.. 阅读全文
摘要：
http://ac.nbutoj.com/Problem/view.xhtml?id=1479[1479] How many时间限制: 1000 ms 内存限制: 65535 K问题描述There are N numbers, no repeat. All numbers is between 1 and 120, and N is no more than 60. then given a number K(1 2 #include 3 #include 4 #include 5 6 using namespace std; 7 int dp[110]; 8 9 int main... 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1403Longest Common SubstringTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3068 Accepted Submission(s): 1087 Problem DescriptionGiven two strings, you have to tell the length of the Longest Common Substr 阅读全文