hdu 4691 Front compression

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

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

 const int MAXN=;
 char str[MAXN];

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

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

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