我是谁——Acwing 1460

#include <iostream>
#include <cstring>
#include <unordered_set>

using namespace std;

int n;
string s;

bool check(int mid)
{
    unordered_set<string> hash;
    for (int i = 0; i + mid - 1 < n; i ++ ) 
    {
        auto str = s.substr(i, mid);
        if (hash.count(str)) return false;
        hash.insert(str);
    }
    
    return true;
}

int main()
{
    cin >> n;
    cin >> s;
    
    int l = 1, r = n;
    while (l < r)
    {
        int mid = l + r >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }
    
    cout << r << endl;
    return 0;
}