Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <string>
- #include <vector>
- #include <map>
- #include <set>
- #include <queue>
- #include <algorithm>
- #include <climits>
- #include <time.h>
- #include <stdio.h>
- #include <string.h>
- using namespace std;
- #define sc second
- #define fs first
- #define forr(i,n) for(i = 0; i < n; i++)
- typedef long long ll;
- string s;
- int n;
- const int maxlen = 4000005;
- const int alphabet = 26;
- int p[maxlen], cnt[maxlen], c[maxlen];
- int pn[maxlen], cn[maxlen];
- int main() {
- freopen("array.in","r",stdin);
- // freopen("array.out", "w", stdout);
- int i,j;
- cin >> s;
- n = s.size();
- memset (cnt, 0, alphabet * sizeof(int));
- for (int i=0; i<n; ++i)
- ++cnt[s[i]];
- for (int i=1; i<alphabet; ++i)
- cnt[i] += cnt[i-1];
- for (int i=0; i<n; ++i)
- p[--cnt[s[i]]] = i;
- c[p[0]] = 0;
- int classes = 1;
- for (int i=1; i<n; ++i) {
- if (s[p[i]] != s[p[i-1]]) ++classes;
- c[p[i]] = classes-1;
- }
- for (int h=0; (1<<h)<n; ++h) {
- for (int i=0; i<n; ++i) {
- pn[i] = p[i] - (1<<h);
- if (pn[i] < 0) pn[i] += n;
- }
- memset (cnt, 0, classes * sizeof(int));
- for (int i=0; i<n; ++i)
- ++cnt[c[pn[i]]];
- for (int i=1; i<classes; ++i)
- cnt[i] += cnt[i-1];
- for (int i=n-1; i>=0; --i)
- p[--cnt[c[pn[i]]]] = pn[i];
- cn[p[0]] = 0;
- classes = 1;
- for (int i=1; i<n; ++i) {
- int mid1 = (p[i] + (1<<h)) % n, mid2 = (p[i-1] + (1<<h)) % n;
- if (c[p[i]] != c[p[i-1]] || c[mid1] != c[mid2])
- ++classes;
- cn[p[i]] = classes-1;
- }
- memcpy (c, cn, n * sizeof(int));
- }
- for(int i = 0; i < n; i++) {
- cout << c[p[i]] << " ";
- }
- cout << endl;
- for(int i = 0; i < n; i++) {
- cout << cnt[i] << " ";
- }
- cout << endl;
- for(int i = 0; i < n; i++) {
- cout << c[i] << " ";
- }
- cout << endl;
- for(int i = 0; i < n; i++) {
- cout << pn[i] << " ";
- }
- cout << endl;
- for(int i = 0; i < n; i++) {
- cout << cn[i] << " ";
- }
- cout << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement