Z-array

input/code.cpp: In function 'void solve()':
input/code.cpp:28:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (int i = 1; i < zArr.size(); i++)
      |                     ~~^~~~~~~~~~~~~
input/code.cpp:35:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             while (r < s.size() && s[r] == s[comp])
      |                    ~~^~~~~~~~~~
input/code.cpp:54:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |                 while (comp1 < s.size() && s[comp1] == s[comp2])
      |                        ~~~~~~^~~~~~~~~~
input/code.cpp:66:23: warning: comparison of integ...

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <queue>
#include <climits>
#include <cmath>
#include <functional>
#include <type_traits>
#include <bitset>
 
#define int long long
using namespace std;
 
void solve() {
    string s;
    cin >> s;

    int l = 0, r = 0;
    vector<int> zArr(s.size());
    zArr[0] = s.size();

    for (int i = 1; i < zArr.size(); i++)
    {
        if (i > r)
        {
            // Use naive approach
            int comp = 0;
            r = i;
            while (r < s.size() && s[r] == s[comp])
            {
                r++;
                comp++;
            }
            r--;
            l = i;
            zArr[i] = r-l+1;
        }
        else
        {
            // Case 2
            if (zArr[i-l] < r-i+1)
                zArr[i] = zArr[i-l];
            else
            {
                // Case 3
                int comp1 = r+1;
                int comp2 = comp1 - i;
                while (comp1 < s.size() && s[comp1] == s[comp2])
                {
                    comp1++;
                    comp2++;
                }
                r = comp1 - 1;
                l = i;
                zArr[i] = r-l+1;
            }
        }
    }

    for (int i = 0; i < zArr.size(); i++)
        cout << zArr[i] << " ";
}
 
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}

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