Uva LA 4513 Stammering Aliens(Follow the example, solve by lcp using hash)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 4e4 + 10;
const int x = 123;
int n,m,pos;
unsigned long long H[maxn],xp[maxn];

unsigned long long make_hash[maxn];
int ran[maxn];

bool cmp(const int &a,const int &b)
{
    return make_hash[a]<make_hash[b]||(make_hash[a]==make_hash[b]&&a<b);
}

int check(int v)
{
    pos=-1;
    int i;
    for(i=0;i+v-1<n;i++)
    {
        ran[i]=i;
        make_hash[i]=H[i]-H[i+v]*xp[v];
    }
    sort(ran,ran+n-v+1,cmp);
    int cnt=0;
    for(i=0;i<n-v+1;i++)
    {
        if(i==0||make_hash[ran[i]]!=make_hash[ran[i-1]])  cnt=0;
        if(++cnt>=m)  pos=max(pos,ran[i]);
    }
    return pos>=0;
}

int main()
{
    char s[maxn];
    int i;
    xp[0]=1;
    for(i=1;i<=4e4;i++)  xp[i]=xp[i-1]*x;
    while(scanf("%d",&m)!=EOF&&m)
    {
        scanf("%s",s);
        n=(int)strlen(s);
        H[n]=0;
        for(i=n-1;i>=0;i--)  H[i]=H[i+1]*x+(s[i]-'a');
        if(!check(1))
        {
            printf("none\n");
        }
        else
        {
            int ans=1;
            int l=1,r=n+1;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(check(mid))
                {
                    ans=mid;
                    l=mid+1;
                }
                else
                {
                    r=mid-1;
                }
            }
            check(ans);
            printf("%d %d\n",ans,pos);
        }
    }
    return 0;
}