-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathD.cpp
57 lines (46 loc) · 918 Bytes
/
D.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
#define cerr cerr << "DEBUG "
vector<vector<int>> g;
vector<int> sz;
void dfs(int v) {
sz[v] = 1;
for (auto &u : g[v]) {
dfs(u);
sz[v] += sz[u];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
int n = (int) s.size();
vector<int> f(n);
int k = 0;
for (int i = 1; i < n; ++i) {
while (k && s[i] != s[k]) {
k = f[k - 1];
}
k += (s[i] == s[k]);
f[i] = k;
}
g.resize(n + 1);
sz.resize(n + 1);
for (int i = 0; i < n; ++i) {
g[f[i]].push_back(i + 1);
}
dfs(0);
vector<pair<int, int>> ans;
ans.push_back({n, 1});
int i = f[n - 1];
while (i > 0) {
ans.push_back({i, sz[i]});
i = f[i - 1];
}
reverse(ans.begin(), ans.end());
cout << ans.size() << '\n';
for (auto &x : ans) {
cout << x.first << ' ' << x.second << '\n';
}
}