Z-array

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define int long long

vector<int> solve(string s){
    int n = s.size();
    vector<int> Z(n, 0);
    Z[0] = n;

    int l = 0, r = 0;
    rep(i,1,n){
        if (i <= r){
            Z[i] = min(r - i + 1, Z[i - l]);
        }

        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;
        }
    }
    
    return Z;
}

signed main(){
    string s;
    cin >> s;
    vector<int> sol = solve(s);
    for (int i : sol) {
        cout << i << " ";
    }
}

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