需求:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 如果一个字符串从左向右写和从右向左写是一样的,这样的字符串就叫做palindromic string 判断回文数,中间开花.定一个中心,向两边散…
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers. Non-palindromic numbers can be paired with palin…
Victor and String Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/262144 K (Java/Others) Total Submission(s): 163 Accepted Submission(s): 78 Problem Description Victor loves to play with string. He thinks a string is charming as the…
Palindromic Substring Time Limit: 10 Seconds Memory Limit: 65536 KB In the kingdom of string, people like palindromic strings very much. They like only palindromic strings and dislike all other strings. There is a unified formula to calculate th…
Palindromic Substring Time Limit: 10000ms Memory Limit: 65536KB This problem will be judged on HDU. Original ID: 442664-bit integer IO format: %I64d Java class name: Main In the kingdom of string, people like palindromic strings very much. They…
Victor and String Time Limit: 1000ms Memory Limit: 262144KB This problem will be judged on HDU. Original ID: 542164-bit integer IO format: %I64d Java class name: Main Victor loves to play with string. He thinks a string is charming as the string…
假设没有操作1,就是裸的回文串自己主动机...... 能够从头部插入字符的回文串自己主动机,维护两个last点就好了..... 当整个串都是回文串的时候把两个last统一一下 Victor and String Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/262144 K (Java/Others) Total Submission(s): 30 Accepted Submission(s): 9 Probl…
两道差不多的题,都是回文自动机right集合处理相关. Victor and String Victor loves to play with string. He thinks a string is charming as the string is a palindromic string. Victor wants to play n times. Each time he will do one of following four operations. add a char c to…
HDU 3294 Problem Description One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:First step: girls will write a long string (only contains lower case) on the paper. For exa…
xiaoxin juju needs helpTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit Status DescriptionAs we all known, xiaoxin is a brilliant coder. He knew **palindromic** strings when he was only a six grade student at elementry sc…
Girls' research Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 537 Accepted Submission(s): 199 Problem Description One day, sailormoon girls are so delighted that they intend to research abo…
Keep On Movin Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 76 Accepted Submission(s): 68 Problem Description Professor Zhang has kinds of characters and the quantity of the i-th character…
Keep On Movin 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5744 Description Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He…
Girls' research Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1160 Accepted Submission(s): 448 Problem Description One day, sailormoon girls are so delighted that they intend to research a…
Problem Description Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He also wants to maximize the length of the shortest palindro…
A. Quasi-palindrome time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Let quasi-palindromic number be such number that adding some leading zeros (possible none) to it produces a palindromic s…
Description Let quasi-palindromic number be such number that adding some leading zeros (possible none) to it produces a palindromic string. String t is called a palindrome, if it reads the same from left to right and from right to left. For example,…
Problem Description One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:First step: girls will write a long string (only contains lower case) on the paper. For example, "abcd…
Girls' researchTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4401 Accepted Submission(s): 1642 Problem Description One day, sailormoon girls are so delighted that they intend to research about pa…
One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' ins…
