G:Prefixes and Suffixes(2016华工安信证券杯校赛）(还没搞懂！！)

Codeforces Round #246 (Div. 2)D
D. Prefixes and Suffixes

time limit per test：1 second

You have a string s = s1s2…s|s|, where |s| is the length of string s, and si its i-th character.
Let’s introduce several definitions:
A substring s[i..j] (1 ≤ i ≤ j ≤ |s|) of string s is string sisi + 1…sj.
The prefix of string s of length l (1 ≤ l ≤ |s|) is string s[1..l].
The suffix of string s of length l (1 ≤ l ≤ |s|) is string s[|s| - l + 1..|s|].
Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring.
Input
The single line contains a sequence of characters s1s2…s|s| (1 ≤ |s| ≤ 105) — string s. The string only consists of uppercase English letters.
Output
In the first line, print integer k (0 ≤ k ≤ |s|) — the number of prefixes that match a suffix of string s. Next print k lines, in each line print two integers li ci. Numbers li ci mean that the prefix of the length li matches the suffix of length li and occurs in string s as a substring ci times. Print pairs li ci in the order of increasing li.
Sample test(s)
Input

ABACABA

Output

3
1 4
3 2
7 1

Input

AAA

Output

3
1 3
2 2
3 1

题意：

给你一个长度不超过10^5的字符串。要你按长度输出和后缀完全匹配的的前缀的长度。和该前缀在整个串中出现的次数。（可重叠）

TLE代码：

include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<vector>
using namespace std;
#define P pair<int,int>
const int maxn = 1000100;
int Next[maxn];
string p, T;
int n, m;

void getnext(int n){
    Next[0] = 0;
    for (int i = 1, j = 0; i<n; i++){
        while (j>0 && p[j] != p[i])
            j = Next[j - 1];
        if (p[i] == p[j])j++;
        Next[i] = j;
    }
}
int kmp(int m, int n)
{
    getnext(n);
    int cnt = 0;
    for (int i = 0, j = 0; i<m; i++)
    {
        while (j>0 && T[i] != p[j])
            j = Next[j - 1];
        if (T[i] == p[j])j++;
        if (j == n){ cnt++; j = 0; }
    }
    return cnt;
}
int main()
{
    cin >> T;
    m = T.size();
    vector<P>pa;

    for (int i = 1; i <= m; i++)
    {
        string a = T.substr(0, i);
        //cout << a << endl;
        string b = T.substr(m - i, i);
        //cout << b << endl;

        if (a == b)
        {
            p = a;//比赛的时候应该是两个人打一份代码，忘了把p更新
            P tmp;
            tmp.first = kmp(m, i);
            tmp.second = i;
            pa.push_back(tmp);
        }
    }
    cout << pa.size() << endl;
    for (int i = 0; i < pa.size(); i++)
        cout << pa[i].second << " " << pa[i].first << endl;
}