Language: C++

/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <vector>
#include <complex>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
#define ll long long
 
const long long MAXN = 4e7 + 1;
const long long MOD = 1e9 + 7;
using namespace std;
 
typedef pair<int, int> pii;
 
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}
 
char a[MAXN];


int num = 1;
 
struct node {
  int nxt[26];
  node();
};
 
node::node(){
  for(int i = 0; i < 26; ++i){
    nxt[i] = -1;
  }
}
 
node t[MAXN];

int last[MAXN];

int main(){
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    int n = readInt();
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        last[i] = 0;
    }
    int mx = 0;
    for (int i = 1; i <= n; i++) {
        int v = 0;
        int ans = 0;
        for (int j = i; j <= n; j++) {
            int c = a[j] - 'a';
            if (t[v].nxt[c] == -1) break;
            ans++;
            v = t[v].nxt[c];
        }
        int c = a[i] - 'a';
        for (int j = 1; j <= i; j++) {
            int v = last[j];
            if (t[v].nxt[c] == -1) {
                t[v].nxt[c] = num++;
            } last[j] = t[v].nxt[c];
        }
        mx = max(mx, ans);
    }
    cout << mx << endl;
    return 0;
}


Compiler output:
/tmp/cc5WEKfY.o: in function `main':
a.cc:(.text+0x11e): relocation truncated to fit: R_X86_64_PC32 against symbol `last' defined in .bss section in /tmp/cc5WEKfY.o
a.cc:(.text+0x23b): relocation truncated to fit: R_X86_64_PC32 against symbol `last' defined in .bss section in /tmp/cc5WEKfY.o
a.cc:(.text+0x306): relocation truncated to fit: R_X86_64_PC32 against symbol `last' defined in .bss section in /tmp/cc5WEKfY.o
collect2: error: ld returned 1 exit status