hdu 4691 Front compression

暴力水过，剪一下枝= =果断是数据水了

#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL __int64
using namespace std;

const int MAXN=111111;
char str[MAXN];

int same(int a,int b,int x,int y)
{
    if(a==x)
        return min(b,y)-a;
    int i=0;
    while((a+i)<b&&(x+i)<y&&str[a+i]==str[x+i])
        i++;
    return i;
}

int num(int x)
{
    if(!x)return 1;
    int ans=0;
    while(x!=0)
    {
        ans++;
        x/=10;
    }
    return ans;
}

int main()
{
    int n,a,b,x,y,q,p;
    while(~scanf("%s",str))
    {
        scanf("%d",&n);
        LL s,t;
        s=t=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&a,&b);
            if(i!=0)q=same(a,b,x,y);
            else q=0;
            p=num(q);
            s+=b-a+1;
            t+=p+1+b-a-q+1;
            x=a;y=b;
        }
        printf("%I64d %I64d
",s,t);
    }
    return 0;
}