hdu-3518-Boring counting

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define inf 0x3f3f3f3f

const int N = 1100;

int r
, tx
, ty
, rs
, ranks
, sa
, height
, rmq
[20]; //rs基数排序
char s
;

bool cmp(int *r, int a, int b, int len)
{
return (r[a] == r[b]) && (r[a + len] == r[b + len]);
}

void suffix(int n, int m) //n为长度，最大值小于m
{
int i, j, p, *x = tx, *y = ty, *t;
for(i = 0; i < m; ++i)
rs[i] = 0;
for(i = 0; i < n; ++i) {
x[i] = r[i];
++rs[x[i]];
}
for(i = 1; i < m; ++i)
rs[i] += rs[i - 1];
for(i = n - 1; i >= 0; --i)
sa[--rs[x[i]]] = i;
for(j = p = 1; p < n; j <<= 1, m = p) {
for(p = 0, i = n - j; i < n; ++i)
y[p++] = i;
for(i = 0; i < n; ++i) {
if(sa[i] >= j)
y[p++] = sa[i] - j;
}
for(i = 0; i < m; ++i)
rs[i] = 0;
for(i = 0; i < n; ++i)
++rs[x[y[i]]];
for(i = 1; i < m; ++i)
rs[i] += rs[i - 1];
for(i = n - 1; i >= 0; --i)
sa[--rs[x[y[i]]]] = y[i];
t = x, x = y, y = t;
for(i = 1, p = 1, x[sa[0]] = 0; i < n; ++i) {
if(cmp(y, sa[i - 1], sa[i], j))
x[sa[i]] = p - 1;
else
x[sa[i]] = p++;
}
}
/**for(i = 0; i < n; ++i)
printf("%s\n", s + sa[i]);*/
}

void calheight(int n)
{
int i, j, k = 0;
for(i = 1; i <= n; ++i)
ranks[sa[i]] = i;
for(i = 0; i < n; ++i) {
if(k)
--k;
j = sa[ranks[i] - 1];
while(r[i + k] == r[j + k])
++k;
height[ranks[i]] = k;
}
}

int main()
{
while(scanf("%s",s))
{
int i,j,k;
int len=strlen(s);
if(len==1 && s[0]=='#') break;
for(i=0;i<len;i++)
r[i]=s[i];
r[len]=0;
suffix(len+1,130);
calheight(len);
int sum=0;
for(j=1;j<=len/2;j++)
{
int mx=sa[1],mn=sa[1];
for(i=2;i<=len;i++)
{
while(1)
{
if(height[i]>=j)
{
mx=max(mx,sa[i]);
mn=min(mn,sa[i]);
i++;
if(i>len) break;
}
else break;
}
if(mx-mn>=j) sum++;
mx=sa[i],mn=sa[i];
}
}
cout<<sum<<endl;
}
}