poj 3415 http://poj.org/problem?id=3415(二)

2014-11-24 11:24:02 · 作者: · 浏览: 1
,i,sum);
continue;
}
if(sa[i]>len1)
{
tmp.num=1;
tmp.h=height[i+1];
sum+=height[i+1]-k+1;
while(top=height[i+1])
{
sum-=(q[tail-1].h-tmp.h)*q[tail-1].num;
tmp.num+=q[tail-1].num;
tail--;
}
q[tail++]=tmp;
// printf("i %d sum %I64d\n",i,sum);
}
else if(sa[i] {
ans+=sum;
if(i==n) continue;
tmp.num=0;
tmp.h=height[i+1];
while(top=height[i+1])
{
sum-=(q[tail-1].h-tmp.h)*q[tail-1].num;
tmp.num+=q[tail-1].num;
tail--;
}
if(tmp.num) q[tail++]=tmp;
// printf("i %d sum %I64d\n",i,sum);
}
}
return ans;
}
char s[M],str[M];
int main()
{
int i,n,k,len1;
while(scanf("%d",&k),k)
{
scanf("%s%s",s,str);
len1=strlen(s);
s[len1]='|';
s[len1+1]=0;
strcat(s,str);
n=strlen(s);
// printf("%s\n",s);
for(i=0;i r[n]=0;
da(n+1,128);
calh(n);
// for(i=1;i<=n;i++)
// {
// printf("i %d sa %d h %d\n",i,sa[i],height[i]);
// }
printf("%I64d\n",solve(len1,n,k));
}
}

作者:Wings_of_Liberty