原创 POJ - 3450 Corporate Identity (後綴數組 多串最大公共子串)
Corporate Identity Beside other services, ACM helps companies to clearly state their “corporate identity”, which incl
原创 POJ - 3261 Milk Patterns (後綴數組 最長可重疊重複k次子串 + 二分)
Milk Patterns Farmer John has noticed that the quality of milk given by his cows varies from day to day. On further i
原创 POJ - 2774 Long Long Message (後綴數組 最長公共子串)
Long Long Message The little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him
原创 POJ - 2411 Mondriaan's Dream (狀壓DP)
Mondriaan's Dream Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after produci
原创 CSU - 1632 Repeated Substrings (後綴數組 至少出現兩次的子串個數)
Repeated Substrings String analysis often arises in applications from biology and chemistry, such as the study of DNA
原创 HDU - 4272 LianLianKan (狀壓DP)
LianLianKan I like playing game with my friend, although sometimes looks pretty naive. Today I invent a new game call
原创 POJ - 3294 Life Forms (後綴數組 多串至少出現在k個串中的最長公共子串)
Life Forms You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial trait
原创 POJ - 1226 Substrings (後綴數組 出現或反轉後出現在每個字符串中的最長公共子串)
Substrings You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such
原创 SPOJ - PHRASES Relevant Phrases of Annihilation (後綴數組 至少出現兩次且不重疊的最長公共子串)
Relevant Phrases of Annihilation You are the King of Byteland. Your agents have just intercepted a batch of encrypted
原创 POJ - 1743 Musical Theme (後綴數組 最長不重疊重複子串 +二分)
Musical Theme A musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1.
原创 HDU-6659 Acesrc and Good Numbers (數位dp)
Acesrc and Good Numbers 題目鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=6659 題目大意:f ( d , n ) 表示 1 - n的十進制數中有多少個d,給出d n,
原创 POJ - 3080 Blue Jeans (後綴數組 多串最大公共子串)
Blue Jeans The Genographic Project is a research partnership between IBM and The National Geographic Society that is
原创 POJ - 2406 Power Strings (後綴數組 最大重複次數)
Power Strings Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "d
原创 SPOJ - DISUBSTR Distinct Substrings (後綴數組 不同子串個數)
Distinct Substrings Given a string, we need to find the total number of its distinct substrings. Input T- number of t
原创 SPOJ - REPEATS Repeats (後綴數組 + RMQ 重複次數最多的連續重複子串的重複次數)
Repeats A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with len