[NOI2015] 品酒大会

#include <bits/stdc++.h>
using namespace std;
string s;
int sa[300005],rk[20][300005],r[300005],n,w,h[300005],p[25],z[300005],st0[20][300005],st1[20][300005],f[600005];
long long a[300005],c[300005],ans[300005],maxn[300005],g[300005];
struct t1
{
	char c;
	int id;
}t[300005];
int read1()
{
	char cc=getchar();
	while(!(cc>=48&&cc<=57))
	{
		if(cc=='-')
		{
			break;
		}
		cc=getchar();
	}
	bool f=false;
	int s=0;
	if(cc=='-')
	{
		f=true;
	}
	else
	{
		s=cc-48;
	}
	while(1)
	{
		cc=getchar();
		if(cc>=48&&cc<=57)
		{
			s=s*10+cc-48;
		}
		else
		{
			break;
		}
	}
	if(f==true)
	{
		s=-s;
	}
	return s;
}
bool cmp1(t1 a,t1 b)
{
	return a.c<b.c;
}
bool cmp2(int a,int b)
{
	if(rk[w-1][a]!=rk[w-1][b])
	{
		return rk[w-1][a]<rk[w-1][b];
	}
	return rk[w-1][min(a+p[w-1],n+1)]<rk[w-1][min(b+p[w-1],n+1)];
}
void SA()
{
	p[0]=1;
	for(int i=1;i<=20;i++)
	{
		p[i]=p[i-1]*2;
	}
	for(int i=0;i<n;i++)
	{
		t[i+1].c=s[i];
		t[i+1].id=i+1;
		sa[i+1]=i+1;
	}
	sort(t+1,t+n+1,cmp1);
	int cnt=0;
	t[0].c=' ';
	for(int i=1;i<=n;i++)
	{
		if(t[i].c!=t[i-1].c)
		{
			cnt++;
		}
		rk[0][t[i].id]=cnt;
	}
	for(int i=1;i<=19;i++)
	{
		w=i;
		sort(sa+1,sa+n+1,cmp2);
		cnt=0;
		for(int j=1;j<=n;j++)
		{
			if(rk[w-1][sa[j]]!=rk[w-1][sa[j-1]]||rk[w-1][min(sa[j]+p[w-1],n+1)]!=rk[w-1][min(sa[j-1]+p[w-1],n+1)])
			{
				cnt++;
			}
			rk[w][sa[j]]=cnt;
		}
	}
	for(int i=1;i<=n;i++)
	{
		r[i]=rk[19][i];
	}
	int k=0;
	for(int i=1;i<=n;i++)
	{
		if(r[i]==1)
		{
			h[1]=0;
			k=0;
			continue;
		}
		while(i+k-1<n&&sa[r[i]-1]+k-1<n&&s[i+k-1]==s[sa[r[i]-1]+k-1])
		{
			k++;
		}
		h[r[i]]=k;
		if(k)
		{
			k--;
		}
	}
}
void shuchu()
{
	for(int i=n-1;i>0;i--)
	{
		ans[i-1]+=ans[i];
		maxn[i-1]=max(maxn[i-1],maxn[i]);
	}
	for(int i=1;i<=n;i++)
	{
		if(ans[i-1]==0)
		{
			puts("0 0");
		}
		else
		{
			printf("%lld %lld\n",ans[i-1],maxn[i-1]);
		}
	}
}
long long ask0(int l,int r)
{
	int len=r-l+1;
	len=f[len];
	return max(st0[len][l],st0[len][r-p[len]+1]);
}
long long ask1(int l,int r)
{
	int len=r-l+1;
	len=f[len];
	return min(st1[len][l],st1[len][r-p[len]+1]);
}
void pre()
{
	for(int i=1;i<=19;i++)
	{
		for(int j=p[i-1];j<p[i];j++)
		{
			f[j]=i-1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		c[i]=a[sa[i]];
		st0[0][i]=c[i];
		st1[0][i]=c[i];
	}
	for(int i=1;i<=18;i++)
	{
		for(int j=1;j+p[i]-1<=n;j++)
		{
			st0[i][j]=max(st0[i-1][j],st0[i-1][j+p[i-1]]);
			st1[i][j]=min(st1[i-1][j],st1[i-1][j+p[i-1]]);
		}
	}
}
int main()
{
	cin>>n;
	cin>>s;
	for(int i=1;i<=n;i++)
	{
		a[i]=read1();
		maxn[i]=LLONG_MIN;
	}
	SA();
	pre();
	int top=0;
	z[0]=1;
	for(int i=2;i<=n;i++)
	{
		while(top>0&&h[i]<=h[z[top]])
		{
			ans[h[z[top]]]-=(g[top]*(n-i+1));
			maxn[h[z[top]]]=max(maxn[h[z[top]]],ask0(z[top-1],z[top]-1)*ask0(z[top],i-1));
			maxn[h[z[top]]]=max(maxn[h[z[top]]],ask1(z[top-1],z[top]-1)*ask1(z[top],i-1));
			top--;
		}
		top++;
		z[top]=i;
		g[top]=z[top]-z[top-1];
		ans[h[z[top]]]+=(g[top]*(n-i+1));
	}
	while(top>0)
	{
		maxn[h[z[top]]]=max(maxn[h[z[top]]],ask0(z[top-1],z[top]-1)*ask0(z[top],n));
		maxn[h[z[top]]]=max(maxn[h[z[top]]],ask1(z[top-1],z[top]-1)*ask1(z[top],n));
		top--;
	}
	shuchu();
	return 0;
}