1.链接地址: http://bailian.openjudge.cn/practice/1226/ http://poj.org/problem?id=1226 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its in…
Substrings Time Limit: 1000ms Memory Limit: 10000KB This problem will be judged on PKU. Original ID: 122664-bit integer IO format: %lld Java class name: Main You are given a number of case-sensitive strings of alphabetic characters, find the l…
跟3294比较类似,但是不需要输出具体的串,比较简单,只要把串反转连接上去解法就一样了. #include <iostream> #include <cstdio> #include <cstring> using namespace std; const int maxn=1e5+9; int r[maxn]; int c[maxn]; char a[1111]; int n,m; int *rank,height[maxn],sa[maxn]; int wx[max…