Z-array

#include<bits/stdc++.h>
using namespace std;

const int N=1000005;

vector<int> CalcZ(string s) {
    int n = (int)s.length();
    vector<int> z(n);

    int i = 1, l = 0, r = 0;
    while(i < n)
    {
        if (i <= r && z[i - l] < r - i + 1) {
            z[i] = z[i - l];
        } else {
            z[i] = max(0, r - i + 1);
            while (i + z[i] < n && s[z[i]] == s[i + z[i]]) 
                z[i]++;
        }
        if (i + z[i] - 1 > r) 
            l = i, r = i + z[i] - 1;
        i++;
    }
    return z;
}

int main()
{	
    string str;
    cin >> str;
    auto ans = CalcZ(str);
    ans[0] = str.length();
    for(int x: ans)
        cout << x << " ";
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED