牛人的ACM CATCHER程序!

最新推荐文章于 2024-02-25 18:23:11 发布

thunk123

最新推荐文章于 2024-02-25 18:23:11 发布

阅读量97

点赞数

本文链接：https://blog.csdn.net/haochao/article/details/2928857

版权

#include<stdio.h>
#include<string.h>
#include<memory.h>
//#include<assert.h>
#define MAX_LEN 80
char szInput[MAX_LEN+1];
unsigned char B[(MAX_LEN+1)*MAX_LEN/8];
unsigned char Bit8[8]={0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01};
#define GETB(i,j) (B[(i)*10+((j)>>3)] & Bit8[(j) & 0x7])
#define SETB(i,j) B[(i)*10+((j)>>3)] |= Bit8[(j) & 0x7]
int length;
int getcode()
{
int i,j,notfound1,notfound2=0;
if(length<2)
  return 1;
memset(B,0,(length+1)*10);
for(i=0;i<2;++i)
{
  for(j=0;j<length;++j)
   SETB(i,j);//B[i][j]=1;
}
for(i=2;i<=length;++i)
{
  for(notfound1=1,j=0;j<=length-i;++j)
  {
   if(GETB(i-2,j+1)/*B[i-2][j+1]*/ && szInput[j]==szInput[j+i-1])
   {
    SETB(i,j);//B[i][j]=1;
    //printf("%d,%d = 1/n",i,j);
    notfound1=0;
   }
  }
  if(notfound1)
  {
   if(notfound2)
    return i-2;
   notfound2=1;
  }
  else
  {
   notfound2=0;
  }
}
if(notfound2)
  return length-1;
return length;
}
int main(void)
{
while(scanf("%s",szInput)!=EOF)
{
  length=strlen(szInput);
  //assert(length<=MAX_LEN);
  printf("%d/n",getcode());
}
    return 0;
}