Z-function

#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;

const int inf = 2000000007;

int z[10000];

int main()
{

    string s;
    cin >> s;
    int n = s.size();

    z[0] = 0;

    int l = 0, r = 0;
    for (int i = 1; i < n && l < n && r < n; i++)
    {
        if (l <= i && i <= r)
            z[i] = min(r - i + 1, z[i - l]);

        while (i + z[i] < n && s[i + z[i]] == s[z[i]])
            z[i]++;

        if (i + z[i] - 1 > r)
        {
            r = i + z[i] - 1;
            l = i;
        }
    }

    for (int i = 0; i < n; i++)
        cout << z[i] << " ";

    return 0;
}