Lumimyrsky

#include <iostream>
#include <vector>
#include <math.h>
#include <limits.h>
#include <set>
#include <algorithm>
#include <queue>
#include <bitset>
#include <limits.h>
#include <float.h>
#include <stack>
#include <map>
 
using namespace std;
using ll = long long;

vector<int> z(string s) {
    int n = s.size();
    vector<int> z(n);
    int x = 0, y = 0;
    for (int i = 1; i < n; i++) {
        z[i] = max(0,min(z[i-x],y-i+1));
        while (i+z[i] < n && s[z[i]] == s[i+z[i]]) {
            x = i; y = i+z[i]; z[i]++;
        }
    }
    return z;
}
 
int main()
{
    string s;
    cin >> s;
    auto vec = z(s);
    vec[0] = s.length();
    for(auto i: vec) {
        cout << i << " ";
    }
 
    return 0;
 
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED