hdu5008 西安赛区网络赛 B题

先搞一下后缀数组，然后根据后缀数组可以求出以i为左端的字符串们占据多少名

然后就是一个二分

麻烦的是需要输出最左边的，我搞的比较暴力，从当前情况在后缀数组中用两个指针向上向下扫，取左端点最小值，结果390ms比赛提交中最快也是醉了。。。

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int N = 100010;

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

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;
	}
}

void initrmq(int n)
{
	int i, k;
	for(i = 2; i <= n; ++i)
		rmq[i][0] = height[i];
	for(k = 1; (1 << k) <= n; ++k) {
		for(i = 2; i + (1 << k) - 1 <= n; ++i) {
			rmq[i][k] = min(rmq[i][k - 1],
				rmq[i + (1 << (k - 1))][k - 1]);
		}
	}
}
int Log[N];
void initlog()
{
Log[0] = -1;  
    for(int i=1;i<N;i++){  
        Log[i]=(i&(i-1))?Log[i-1]:Log[i-1] + 1 ;}
}

int lcp(int a, int b)
{
	a = ranks[a], b = ranks[b];
	if(a > b)
		swap(a, b);
	++a;
	int k = (int) Log[b - a + 1] / Log[2];
	return min(rmq[a][k], rmq[b - (1 << k) + 1][k]);
}
//求两个串的最长公共子串

__int64 biao[N],sum[N];

int bs(int left,int right,__int64 v)
{
	int mid;
	while(left<right)
	{
		mid=(left+right)>>1;
		if(sum[mid]<v) left=mid+1;//if(不符合条件)
		else right=mid;
	}
	return left;
}

int main()
{
	while( scanf("%s", s)!=EOF)
	{
		int i, j, n,m;
		n = strlen(s);
		for(i = 0; i < n; ++i)
			r[i] = s[i];
		r[n] = 0;//便于比较
		suffix(n + 1, 128);
		calheight(n);

		sum[0]=0;
		for(i=1;i<=n;i++)
		{
			biao[i]=n-sa[i];
			biao[i]=biao[i]-height[i];
			sum[i]=sum[i-1]+biao[i];
		}

		__int64 kk,tt;
		int temp,ll=0,rr=0,anl,anr,chang,ans,b1,b2;
		scanf("%d",&m);
		while(m--)
		{
			scanf("%I64d",&tt);
			kk=(((__int64)ll)^((__int64)rr)^tt)+1;
			if(kk>sum[n])
			{
				ll=0;
				rr=0;
				printf("%d %d\n",ll,rr);
				continue;
			}
			temp=bs(1,n,kk);
			anl=sa[temp];
			anr=anl+height[temp]+kk-sum[temp-1]-1;
			chang=anr-anl+1;
			ans=anl;
			b1=b2=ranks[ans];
			b1++;
			while(b1<=n && height[b1]>=chang)
			{
				ans=min(ans,sa[b1]);
				b1++;
			}
			while(b2>=2 && height[b2]>=chang)
			{
				b2--;
				ans=min(ans,sa[b2]);
			}
			ll=ans+1;
			rr=ll+chang-1;
			printf("%d %d\n",ll,rr);
		}
	}
	return 0;
}